15.75/7.06 YES 15.75/7.06 15.83/7.06 Ultimate: Cannot open display: 15.83/7.06 This is Ultimate 0.1.24-8dc7c08-m 15.83/7.06 [2019-03-28 12:31:16,487 INFO L170 SettingsManager]: Resetting all preferences to default values... 15.83/7.06 [2019-03-28 12:31:16,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 15.83/7.06 [2019-03-28 12:31:16,500 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 15.83/7.06 [2019-03-28 12:31:16,501 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 15.83/7.06 [2019-03-28 12:31:16,502 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 15.83/7.06 [2019-03-28 12:31:16,503 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 15.83/7.06 [2019-03-28 12:31:16,504 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 15.83/7.06 [2019-03-28 12:31:16,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 15.83/7.06 [2019-03-28 12:31:16,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 15.83/7.06 [2019-03-28 12:31:16,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 15.83/7.06 [2019-03-28 12:31:16,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 15.83/7.06 [2019-03-28 12:31:16,509 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 15.83/7.06 [2019-03-28 12:31:16,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 15.83/7.06 [2019-03-28 12:31:16,511 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 15.83/7.06 [2019-03-28 12:31:16,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 15.83/7.06 [2019-03-28 12:31:16,512 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 15.83/7.06 [2019-03-28 12:31:16,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 15.83/7.06 [2019-03-28 12:31:16,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 15.83/7.06 [2019-03-28 12:31:16,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 15.83/7.06 [2019-03-28 12:31:16,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 15.83/7.06 [2019-03-28 12:31:16,519 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 15.83/7.06 [2019-03-28 12:31:16,521 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 15.83/7.06 [2019-03-28 12:31:16,522 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 15.83/7.06 [2019-03-28 12:31:16,522 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 15.83/7.06 [2019-03-28 12:31:16,523 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 15.83/7.06 [2019-03-28 12:31:16,523 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 15.83/7.06 [2019-03-28 12:31:16,524 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 15.83/7.06 [2019-03-28 12:31:16,524 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 15.83/7.06 [2019-03-28 12:31:16,525 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 15.83/7.06 [2019-03-28 12:31:16,525 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 15.83/7.06 [2019-03-28 12:31:16,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 15.83/7.06 [2019-03-28 12:31:16,527 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 15.83/7.06 [2019-03-28 12:31:16,527 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 15.83/7.06 [2019-03-28 12:31:16,528 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 15.83/7.06 [2019-03-28 12:31:16,528 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 15.83/7.06 [2019-03-28 12:31:16,528 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 15.83/7.06 [2019-03-28 12:31:16,529 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 15.83/7.06 [2019-03-28 12:31:16,530 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 15.83/7.06 [2019-03-28 12:31:16,530 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 15.83/7.06 [2019-03-28 12:31:16,545 INFO L110 SettingsManager]: Loading preferences was successful 15.83/7.06 [2019-03-28 12:31:16,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 15.83/7.06 [2019-03-28 12:31:16,546 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 15.83/7.06 [2019-03-28 12:31:16,546 INFO L133 SettingsManager]: * Rewrite not-equals=true 15.83/7.06 [2019-03-28 12:31:16,546 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 15.83/7.06 [2019-03-28 12:31:16,546 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 15.83/7.06 [2019-03-28 12:31:16,547 INFO L133 SettingsManager]: * Use SBE=true 15.83/7.06 [2019-03-28 12:31:16,547 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 15.83/7.06 [2019-03-28 12:31:16,547 INFO L133 SettingsManager]: * Use old map elimination=false 15.83/7.06 [2019-03-28 12:31:16,547 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 15.83/7.06 [2019-03-28 12:31:16,547 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 15.83/7.06 [2019-03-28 12:31:16,547 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 15.83/7.06 [2019-03-28 12:31:16,548 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 15.83/7.06 [2019-03-28 12:31:16,548 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 15.83/7.06 [2019-03-28 12:31:16,548 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 15.83/7.06 [2019-03-28 12:31:16,548 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 15.83/7.06 [2019-03-28 12:31:16,548 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 15.83/7.06 [2019-03-28 12:31:16,548 INFO L133 SettingsManager]: * Check division by zero=IGNORE 15.83/7.06 [2019-03-28 12:31:16,549 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 15.83/7.06 [2019-03-28 12:31:16,549 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 15.83/7.06 [2019-03-28 12:31:16,549 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 15.83/7.06 [2019-03-28 12:31:16,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 15.83/7.06 [2019-03-28 12:31:16,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 15.83/7.06 [2019-03-28 12:31:16,550 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 15.83/7.06 [2019-03-28 12:31:16,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 15.83/7.06 [2019-03-28 12:31:16,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 15.83/7.06 [2019-03-28 12:31:16,550 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 15.83/7.06 [2019-03-28 12:31:16,550 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 15.83/7.06 [2019-03-28 12:31:16,550 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 15.83/7.06 [2019-03-28 12:31:16,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 15.83/7.06 [2019-03-28 12:31:16,589 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 15.83/7.06 [2019-03-28 12:31:16,592 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 15.83/7.06 [2019-03-28 12:31:16,594 INFO L271 PluginConnector]: Initializing CDTParser... 15.83/7.06 [2019-03-28 12:31:16,594 INFO L276 PluginConnector]: CDTParser initialized 15.83/7.06 [2019-03-28 12:31:16,595 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 15.83/7.06 [2019-03-28 12:31:16,656 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/d1094e09204d4adf9472f1540a4086ee/FLAG80344dd33 15.83/7.06 [2019-03-28 12:31:16,994 INFO L307 CDTParser]: Found 1 translation units. 15.83/7.06 [2019-03-28 12:31:16,994 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 15.83/7.06 [2019-03-28 12:31:16,995 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 15.83/7.06 [2019-03-28 12:31:17,001 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/d1094e09204d4adf9472f1540a4086ee/FLAG80344dd33 15.83/7.06 [2019-03-28 12:31:17,425 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/d1094e09204d4adf9472f1540a4086ee 15.83/7.06 [2019-03-28 12:31:17,436 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 15.83/7.06 [2019-03-28 12:31:17,438 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 15.83/7.06 [2019-03-28 12:31:17,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 15.83/7.06 [2019-03-28 12:31:17,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 15.83/7.06 [2019-03-28 12:31:17,443 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 15.83/7.06 [2019-03-28 12:31:17,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:31:17" (1/1) ... 15.83/7.06 [2019-03-28 12:31:17,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e23a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:31:17, skipping insertion in model container 15.83/7.06 [2019-03-28 12:31:17,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:31:17" (1/1) ... 15.83/7.06 [2019-03-28 12:31:17,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 15.83/7.06 [2019-03-28 12:31:17,473 INFO L176 MainTranslator]: Built tables and reachable declarations 15.83/7.06 [2019-03-28 12:31:17,635 INFO L206 PostProcessor]: Analyzing one entry point: main 15.83/7.06 [2019-03-28 12:31:17,649 INFO L191 MainTranslator]: Completed pre-run 15.83/7.06 [2019-03-28 12:31:17,723 INFO L206 PostProcessor]: Analyzing one entry point: main 15.83/7.06 [2019-03-28 12:31:17,739 INFO L195 MainTranslator]: Completed translation 15.83/7.06 [2019-03-28 12:31:17,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:31:17 WrapperNode 15.83/7.06 [2019-03-28 12:31:17,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 15.83/7.06 [2019-03-28 12:31:17,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 15.83/7.06 [2019-03-28 12:31:17,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 15.83/7.06 [2019-03-28 12:31:17,741 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 15.83/7.06 [2019-03-28 12:31:17,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:31:17" (1/1) ... 15.83/7.06 [2019-03-28 12:31:17,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:31:17" (1/1) ... 15.83/7.06 [2019-03-28 12:31:17,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 15.83/7.06 [2019-03-28 12:31:17,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 15.83/7.06 [2019-03-28 12:31:17,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 15.83/7.06 [2019-03-28 12:31:17,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized 15.83/7.06 [2019-03-28 12:31:17,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:31:17" (1/1) ... 15.83/7.06 [2019-03-28 12:31:17,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:31:17" (1/1) ... 15.83/7.06 [2019-03-28 12:31:17,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:31:17" (1/1) ... 15.83/7.06 [2019-03-28 12:31:17,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:31:17" (1/1) ... 15.83/7.06 [2019-03-28 12:31:17,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:31:17" (1/1) ... 15.83/7.06 [2019-03-28 12:31:17,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:31:17" (1/1) ... 15.83/7.06 [2019-03-28 12:31:17,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:31:17" (1/1) ... 15.83/7.06 [2019-03-28 12:31:17,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 15.83/7.06 [2019-03-28 12:31:17,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 15.83/7.06 [2019-03-28 12:31:17,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... 15.83/7.06 [2019-03-28 12:31:17,800 INFO L276 PluginConnector]: RCFGBuilder initialized 15.83/7.06 [2019-03-28 12:31:17,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:31:17" (1/1) ... 15.83/7.06 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 15.83/7.06 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 15.83/7.06 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 15.83/7.06 [2019-03-28 12:31:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 15.83/7.06 [2019-03-28 12:31:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap 15.83/7.06 [2019-03-28 12:31:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 15.83/7.06 [2019-03-28 12:31:17,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 15.83/7.06 [2019-03-28 12:31:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 15.83/7.06 [2019-03-28 12:31:18,046 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 15.83/7.06 [2019-03-28 12:31:18,047 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 15.83/7.06 [2019-03-28 12:31:18,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:31:18 BoogieIcfgContainer 15.83/7.06 [2019-03-28 12:31:18,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 15.83/7.06 [2019-03-28 12:31:18,049 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 15.83/7.06 [2019-03-28 12:31:18,049 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 15.83/7.06 [2019-03-28 12:31:18,051 INFO L276 PluginConnector]: BlockEncodingV2 initialized 15.83/7.06 [2019-03-28 12:31:18,052 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:31:18" (1/1) ... 15.83/7.06 [2019-03-28 12:31:18,067 INFO L313 BlockEncoder]: Initial Icfg 18 locations, 19 edges 15.83/7.06 [2019-03-28 12:31:18,069 INFO L258 BlockEncoder]: Using Remove infeasible edges 15.83/7.06 [2019-03-28 12:31:18,070 INFO L263 BlockEncoder]: Using Maximize final states 15.83/7.06 [2019-03-28 12:31:18,070 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 15.83/7.06 [2019-03-28 12:31:18,071 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 15.83/7.06 [2019-03-28 12:31:18,072 INFO L296 BlockEncoder]: Using Remove sink states 15.83/7.06 [2019-03-28 12:31:18,073 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 15.83/7.06 [2019-03-28 12:31:18,074 INFO L179 BlockEncoder]: Using Rewrite not-equals 15.83/7.06 [2019-03-28 12:31:18,092 INFO L185 BlockEncoder]: Using Use SBE 15.83/7.06 [2019-03-28 12:31:18,110 INFO L200 BlockEncoder]: SBE split 7 edges 15.83/7.06 [2019-03-28 12:31:18,115 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 15.83/7.06 [2019-03-28 12:31:18,117 INFO L71 MaximizeFinalStates]: 0 new accepting states 15.83/7.06 [2019-03-28 12:31:18,135 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 15.83/7.06 [2019-03-28 12:31:18,137 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 15.83/7.06 [2019-03-28 12:31:18,138 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 15.83/7.06 [2019-03-28 12:31:18,139 INFO L71 MaximizeFinalStates]: 0 new accepting states 15.83/7.06 [2019-03-28 12:31:18,144 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 15.83/7.06 [2019-03-28 12:31:18,145 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 15.83/7.06 [2019-03-28 12:31:18,145 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 15.83/7.06 [2019-03-28 12:31:18,146 INFO L71 MaximizeFinalStates]: 0 new accepting states 15.83/7.06 [2019-03-28 12:31:18,146 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 15.83/7.06 [2019-03-28 12:31:18,146 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 15.83/7.06 [2019-03-28 12:31:18,147 INFO L313 BlockEncoder]: Encoded RCFG 11 locations, 18 edges 15.83/7.06 [2019-03-28 12:31:18,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:31:18 BasicIcfg 15.83/7.06 [2019-03-28 12:31:18,147 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 15.83/7.06 [2019-03-28 12:31:18,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 15.83/7.06 [2019-03-28 12:31:18,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... 15.83/7.06 [2019-03-28 12:31:18,152 INFO L276 PluginConnector]: TraceAbstraction initialized 15.83/7.06 [2019-03-28 12:31:18,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:31:17" (1/4) ... 15.83/7.06 [2019-03-28 12:31:18,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1547bb16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:31:18, skipping insertion in model container 15.83/7.06 [2019-03-28 12:31:18,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:31:17" (2/4) ... 15.83/7.06 [2019-03-28 12:31:18,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1547bb16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:31:18, skipping insertion in model container 15.83/7.06 [2019-03-28 12:31:18,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:31:18" (3/4) ... 15.83/7.06 [2019-03-28 12:31:18,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1547bb16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:31:18, skipping insertion in model container 15.83/7.06 [2019-03-28 12:31:18,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:31:18" (4/4) ... 15.83/7.06 [2019-03-28 12:31:18,156 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 15.83/7.06 [2019-03-28 12:31:18,167 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 15.83/7.06 [2019-03-28 12:31:18,176 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. 15.83/7.06 [2019-03-28 12:31:18,196 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. 15.83/7.06 [2019-03-28 12:31:18,226 INFO L133 ementStrategyFactory]: Using default assertion order modulation 15.83/7.06 [2019-03-28 12:31:18,227 INFO L382 AbstractCegarLoop]: Interprodecural is true 15.83/7.06 [2019-03-28 12:31:18,227 INFO L383 AbstractCegarLoop]: Hoare is true 15.83/7.06 [2019-03-28 12:31:18,227 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 15.83/7.06 [2019-03-28 12:31:18,227 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 15.83/7.06 [2019-03-28 12:31:18,227 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 15.83/7.06 [2019-03-28 12:31:18,228 INFO L387 AbstractCegarLoop]: Difference is false 15.83/7.06 [2019-03-28 12:31:18,228 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 15.83/7.06 [2019-03-28 12:31:18,228 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 15.83/7.06 [2019-03-28 12:31:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. 15.83/7.06 [2019-03-28 12:31:18,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 15.83/7.06 [2019-03-28 12:31:18,250 INFO L394 BasicCegarLoop]: Found error trace 15.83/7.06 [2019-03-28 12:31:18,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 15.83/7.06 [2019-03-28 12:31:18,251 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 15.83/7.06 [2019-03-28 12:31:18,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.83/7.06 [2019-03-28 12:31:18,257 INFO L82 PathProgramCache]: Analyzing trace with hash 68135, now seen corresponding path program 1 times 15.83/7.06 [2019-03-28 12:31:18,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.83/7.06 [2019-03-28 12:31:18,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.83/7.06 [2019-03-28 12:31:18,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.83/7.06 [2019-03-28 12:31:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.83/7.06 [2019-03-28 12:31:18,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 15.83/7.06 [2019-03-28 12:31:18,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 15.83/7.06 [2019-03-28 12:31:18,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 15.83/7.06 [2019-03-28 12:31:18,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 15.83/7.06 [2019-03-28 12:31:18,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 15.83/7.06 [2019-03-28 12:31:18,441 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. 15.83/7.06 [2019-03-28 12:31:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 15.83/7.06 [2019-03-28 12:31:18,509 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. 15.83/7.06 [2019-03-28 12:31:18,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 15.83/7.06 [2019-03-28 12:31:18,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 15.83/7.06 [2019-03-28 12:31:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 15.83/7.06 [2019-03-28 12:31:18,522 INFO L225 Difference]: With dead ends: 11 15.83/7.06 [2019-03-28 12:31:18,523 INFO L226 Difference]: Without dead ends: 8 15.83/7.06 [2019-03-28 12:31:18,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 15.83/7.06 [2019-03-28 12:31:18,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. 15.83/7.06 [2019-03-28 12:31:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. 15.83/7.06 [2019-03-28 12:31:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 15.83/7.06 [2019-03-28 12:31:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. 15.83/7.06 [2019-03-28 12:31:18,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 3 15.83/7.06 [2019-03-28 12:31:18,562 INFO L84 Accepts]: Finished accepts. word is rejected. 15.83/7.06 [2019-03-28 12:31:18,562 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 12 transitions. 15.83/7.06 [2019-03-28 12:31:18,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 15.83/7.06 [2019-03-28 12:31:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 12 transitions. 15.83/7.06 [2019-03-28 12:31:18,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 15.83/7.06 [2019-03-28 12:31:18,563 INFO L394 BasicCegarLoop]: Found error trace 15.83/7.06 [2019-03-28 12:31:18,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 15.83/7.06 [2019-03-28 12:31:18,564 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== 15.83/7.06 [2019-03-28 12:31:18,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.83/7.06 [2019-03-28 12:31:18,564 INFO L82 PathProgramCache]: Analyzing trace with hash 68137, now seen corresponding path program 1 times 15.83/7.06 [2019-03-28 12:31:18,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.83/7.06 [2019-03-28 12:31:18,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.83/7.06 [2019-03-28 12:31:18,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.83/7.06 [2019-03-28 12:31:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.83/7.06 [2019-03-28 12:31:18,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 15.83/7.06 [2019-03-28 12:31:18,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 15.83/7.06 [2019-03-28 12:31:18,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 15.83/7.06 [2019-03-28 12:31:18,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 15.83/7.06 [2019-03-28 12:31:18,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 15.83/7.06 [2019-03-28 12:31:18,609 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. Second operand 3 states. 15.83/7.06 [2019-03-28 12:31:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 15.83/7.06 [2019-03-28 12:31:18,631 INFO L93 Difference]: Finished difference Result 8 states and 12 transitions. 15.83/7.06 [2019-03-28 12:31:18,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 15.83/7.06 [2019-03-28 12:31:18,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 15.83/7.06 [2019-03-28 12:31:18,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 15.83/7.06 [2019-03-28 12:31:18,632 INFO L225 Difference]: With dead ends: 8 15.83/7.06 [2019-03-28 12:31:18,632 INFO L226 Difference]: Without dead ends: 0 15.83/7.06 [2019-03-28 12:31:18,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 15.83/7.06 [2019-03-28 12:31:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 15.83/7.06 [2019-03-28 12:31:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 15.83/7.06 [2019-03-28 12:31:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 15.83/7.06 [2019-03-28 12:31:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 15.83/7.06 [2019-03-28 12:31:18,635 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 15.83/7.06 [2019-03-28 12:31:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. 15.83/7.06 [2019-03-28 12:31:18,635 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 15.83/7.06 [2019-03-28 12:31:18,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 15.83/7.06 [2019-03-28 12:31:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 15.83/7.06 [2019-03-28 12:31:18,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 15.83/7.06 [2019-03-28 12:31:18,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 15.83/7.06 [2019-03-28 12:31:18,658 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 15.83/7.06 [2019-03-28 12:31:18,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 15.83/7.06 [2019-03-28 12:31:18,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 15.83/7.06 [2019-03-28 12:31:18,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 15.83/7.06 [2019-03-28 12:31:18,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 15.83/7.06 [2019-03-28 12:31:18,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 15.83/7.06 [2019-03-28 12:31:18,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 15.83/7.06 [2019-03-28 12:31:18,659 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 15.83/7.06 [2019-03-28 12:31:18,660 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. 15.83/7.06 [2019-03-28 12:31:18,660 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 15.83/7.06 [2019-03-28 12:31:18,660 INFO L444 ceAbstractionStarter]: At program point L12-3(lines 12 14) the Hoare annotation is: (and (= 0 ULTIMATE.start_main_~p~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~p~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~p~0.base))) 15.83/7.06 [2019-03-28 12:31:18,661 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 15.83/7.06 [2019-03-28 12:31:18,668 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 15.83/7.06 [2019-03-28 12:31:18,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 15.83/7.06 [2019-03-28 12:31:18,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:31:18 BasicIcfg 15.83/7.06 [2019-03-28 12:31:18,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 15.83/7.06 [2019-03-28 12:31:18,676 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 15.83/7.06 [2019-03-28 12:31:18,677 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 15.83/7.06 [2019-03-28 12:31:18,680 INFO L276 PluginConnector]: BuchiAutomizer initialized 15.83/7.06 [2019-03-28 12:31:18,680 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.83/7.06 [2019-03-28 12:31:18,681 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:31:17" (1/5) ... 15.83/7.06 [2019-03-28 12:31:18,681 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d3ab045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:31:18, skipping insertion in model container 15.83/7.06 [2019-03-28 12:31:18,681 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.83/7.06 [2019-03-28 12:31:18,681 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:31:17" (2/5) ... 15.83/7.06 [2019-03-28 12:31:18,682 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d3ab045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:31:18, skipping insertion in model container 15.83/7.06 [2019-03-28 12:31:18,682 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.83/7.06 [2019-03-28 12:31:18,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:31:18" (3/5) ... 15.83/7.06 [2019-03-28 12:31:18,682 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d3ab045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:31:18, skipping insertion in model container 15.83/7.06 [2019-03-28 12:31:18,682 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.83/7.06 [2019-03-28 12:31:18,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:31:18" (4/5) ... 15.83/7.06 [2019-03-28 12:31:18,683 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d3ab045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:31:18, skipping insertion in model container 15.83/7.06 [2019-03-28 12:31:18,683 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.83/7.06 [2019-03-28 12:31:18,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:31:18" (5/5) ... 15.83/7.06 [2019-03-28 12:31:18,685 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 15.83/7.06 [2019-03-28 12:31:18,706 INFO L133 ementStrategyFactory]: Using default assertion order modulation 15.83/7.06 [2019-03-28 12:31:18,706 INFO L374 BuchiCegarLoop]: Interprodecural is true 15.83/7.06 [2019-03-28 12:31:18,706 INFO L375 BuchiCegarLoop]: Hoare is true 15.83/7.06 [2019-03-28 12:31:18,707 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 15.83/7.06 [2019-03-28 12:31:18,707 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 15.83/7.06 [2019-03-28 12:31:18,707 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 15.83/7.06 [2019-03-28 12:31:18,707 INFO L379 BuchiCegarLoop]: Difference is false 15.83/7.06 [2019-03-28 12:31:18,707 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 15.83/7.06 [2019-03-28 12:31:18,707 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 15.83/7.06 [2019-03-28 12:31:18,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. 15.83/7.06 [2019-03-28 12:31:18,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 15.83/7.06 [2019-03-28 12:31:18,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 15.83/7.06 [2019-03-28 12:31:18,715 INFO L119 BuchiIsEmpty]: Starting construction of run 15.83/7.06 [2019-03-28 12:31:18,720 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 15.83/7.06 [2019-03-28 12:31:18,720 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 15.83/7.06 [2019-03-28 12:31:18,720 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 15.83/7.06 [2019-03-28 12:31:18,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. 15.83/7.06 [2019-03-28 12:31:18,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 15.83/7.06 [2019-03-28 12:31:18,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 15.83/7.06 [2019-03-28 12:31:18,721 INFO L119 BuchiIsEmpty]: Starting construction of run 15.83/7.06 [2019-03-28 12:31:18,722 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 15.83/7.06 [2019-03-28 12:31:18,722 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 15.83/7.06 [2019-03-28 12:31:18,727 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [38] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 3#L-1true [58] L-1-->L12-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~p~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~p~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~p~0.base, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~p~0.offset] 12#L12-3true 15.83/7.06 [2019-03-28 12:31:18,727 INFO L796 eck$LassoCheckResult]: Loop: 12#L12-3true [76] L12-3-->L13: Formula: (and (<= 0 v_ULTIMATE.start_main_~p~0.offset_12) (<= (+ v_ULTIMATE.start_main_~p~0.offset_12 4) (select |v_#length_11| v_ULTIMATE.start_main_~p~0.base_15)) (<= 0 (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~p~0.base_15) v_ULTIMATE.start_main_~p~0.offset_12)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~p~0.base_15) 1)) InVars {#valid=|v_#valid_13|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_15, #memory_int=|v_#memory_int_8|, #length=|v_#length_11|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_12} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_15, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_13|, #length=|v_#length_11|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 10#L13true [72] L13-->L13-2: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~p~0.base_13)) (<= (+ v_ULTIMATE.start_main_~p~0.offset_10 4) (select |v_#length_9| v_ULTIMATE.start_main_~p~0.base_13)) (<= 0 v_ULTIMATE.start_main_~p~0.offset_10) (= |v_ULTIMATE.start_main_#t~post3_5| |v_ULTIMATE.start_main_#t~mem2_5|) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~p~0.base_13) v_ULTIMATE.start_main_~p~0.offset_10) |v_ULTIMATE.start_main_#t~mem2_5|)) InVars {#valid=|v_#valid_11|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_13, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_10} OutVars{#valid=|v_#valid_11|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_5|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_13, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2] 7#L13-2true [75] L13-2-->L12-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~p~0.offset_11 4) (select |v_#length_10| v_ULTIMATE.start_main_~p~0.base_14)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~p~0.base_14)) (<= 0 v_ULTIMATE.start_main_~p~0.offset_11) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~p~0.base_14 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~p~0.base_14) v_ULTIMATE.start_main_~p~0.offset_11 (+ |v_ULTIMATE.start_main_#t~post3_7| (- 1)))))) InVars {#valid=|v_#valid_12|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_7|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_14, #length=|v_#length_10|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_11} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_14, #length=|v_#length_10|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2, #memory_int] 12#L12-3true 15.83/7.06 [2019-03-28 12:31:18,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.83/7.06 [2019-03-28 12:31:18,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2197, now seen corresponding path program 1 times 15.83/7.06 [2019-03-28 12:31:18,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.83/7.06 [2019-03-28 12:31:18,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.83/7.06 [2019-03-28 12:31:18,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.83/7.06 [2019-03-28 12:31:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.83/7.06 [2019-03-28 12:31:18,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.83/7.06 [2019-03-28 12:31:18,761 INFO L82 PathProgramCache]: Analyzing trace with hash 105134, now seen corresponding path program 1 times 15.83/7.06 [2019-03-28 12:31:18,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.83/7.06 [2019-03-28 12:31:18,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.83/7.06 [2019-03-28 12:31:18,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.83/7.06 [2019-03-28 12:31:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.83/7.06 [2019-03-28 12:31:18,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.83/7.06 [2019-03-28 12:31:18,777 INFO L82 PathProgramCache]: Analyzing trace with hash 65526170, now seen corresponding path program 1 times 15.83/7.06 [2019-03-28 12:31:18,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.83/7.06 [2019-03-28 12:31:18,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.83/7.06 [2019-03-28 12:31:18,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.83/7.06 [2019-03-28 12:31:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.83/7.06 [2019-03-28 12:31:18,922 INFO L216 LassoAnalysis]: Preferences: 15.83/7.06 [2019-03-28 12:31:18,924 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 15.83/7.06 [2019-03-28 12:31:18,924 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 15.83/7.06 [2019-03-28 12:31:18,924 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 15.83/7.06 [2019-03-28 12:31:18,924 INFO L127 ssoRankerPreferences]: Use exernal solver: false 15.83/7.06 [2019-03-28 12:31:18,924 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 15.83/7.06 [2019-03-28 12:31:18,925 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 15.83/7.06 [2019-03-28 12:31:18,925 INFO L130 ssoRankerPreferences]: Path of dumped script: 15.83/7.06 [2019-03-28 12:31:18,925 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 15.83/7.06 [2019-03-28 12:31:18,925 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 15.83/7.06 [2019-03-28 12:31:18,925 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 15.83/7.06 [2019-03-28 12:31:18,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.83/7.06 [2019-03-28 12:31:18,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.83/7.06 [2019-03-28 12:31:18,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.83/7.06 [2019-03-28 12:31:18,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.83/7.06 [2019-03-28 12:31:18,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.83/7.06 [2019-03-28 12:31:19,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.83/7.06 [2019-03-28 12:31:19,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.83/7.06 [2019-03-28 12:31:19,265 INFO L300 LassoAnalysis]: Preprocessing complete. 15.83/7.06 [2019-03-28 12:31:19,271 INFO L497 LassoAnalysis]: Using template 'affine'. 15.83/7.06 [2019-03-28 12:31:19,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.83/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.83/7.06 Number of strict supporting invariants: 0 15.83/7.06 Number of non-strict supporting invariants: 1 15.83/7.06 Consider only non-deceasing supporting invariants: true 15.83/7.06 Simplify termination arguments: true 15.83/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.83/7.06 [2019-03-28 12:31:19,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.83/7.06 [2019-03-28 12:31:19,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.83/7.06 [2019-03-28 12:31:19,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.83/7.06 [2019-03-28 12:31:19,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.83/7.06 [2019-03-28 12:31:19,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.83/7.06 [2019-03-28 12:31:19,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.83/7.06 [2019-03-28 12:31:19,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.83/7.06 [2019-03-28 12:31:19,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.83/7.06 [2019-03-28 12:31:19,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.83/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.83/7.06 Number of strict supporting invariants: 0 15.83/7.06 Number of non-strict supporting invariants: 1 15.83/7.06 Consider only non-deceasing supporting invariants: true 15.83/7.06 Simplify termination arguments: true 15.83/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.83/7.06 [2019-03-28 12:31:19,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.83/7.06 [2019-03-28 12:31:19,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.83/7.06 [2019-03-28 12:31:19,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.83/7.06 [2019-03-28 12:31:19,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.83/7.06 [2019-03-28 12:31:19,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.83/7.06 [2019-03-28 12:31:19,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.83/7.06 [2019-03-28 12:31:19,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.83/7.06 [2019-03-28 12:31:19,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.83/7.06 [2019-03-28 12:31:19,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.83/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.83/7.06 Number of strict supporting invariants: 0 15.83/7.06 Number of non-strict supporting invariants: 1 15.83/7.06 Consider only non-deceasing supporting invariants: true 15.83/7.06 Simplify termination arguments: true 15.83/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.83/7.06 [2019-03-28 12:31:19,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.83/7.06 [2019-03-28 12:31:19,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.83/7.06 [2019-03-28 12:31:19,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.83/7.06 [2019-03-28 12:31:19,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.83/7.06 [2019-03-28 12:31:19,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.83/7.06 [2019-03-28 12:31:19,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.83/7.06 [2019-03-28 12:31:19,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.83/7.06 [2019-03-28 12:31:19,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.83/7.06 [2019-03-28 12:31:19,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.83/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.83/7.06 Number of strict supporting invariants: 0 15.83/7.06 Number of non-strict supporting invariants: 1 15.83/7.06 Consider only non-deceasing supporting invariants: true 15.83/7.06 Simplify termination arguments: true 15.83/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.83/7.06 [2019-03-28 12:31:19,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.83/7.06 [2019-03-28 12:31:19,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.83/7.06 [2019-03-28 12:31:19,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.83/7.06 [2019-03-28 12:31:19,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.83/7.06 [2019-03-28 12:31:19,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.83/7.06 [2019-03-28 12:31:19,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.83/7.06 [2019-03-28 12:31:19,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.83/7.06 [2019-03-28 12:31:19,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.83/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.83/7.06 Number of strict supporting invariants: 0 15.83/7.06 Number of non-strict supporting invariants: 1 15.83/7.06 Consider only non-deceasing supporting invariants: true 15.83/7.06 Simplify termination arguments: true 15.83/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.83/7.06 [2019-03-28 12:31:19,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.83/7.06 [2019-03-28 12:31:19,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.83/7.06 [2019-03-28 12:31:19,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.83/7.06 [2019-03-28 12:31:19,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.83/7.06 [2019-03-28 12:31:19,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.83/7.06 [2019-03-28 12:31:19,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.83/7.06 [2019-03-28 12:31:19,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.83/7.06 [2019-03-28 12:31:19,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.83/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.83/7.06 Number of strict supporting invariants: 0 15.83/7.06 Number of non-strict supporting invariants: 1 15.83/7.06 Consider only non-deceasing supporting invariants: true 15.83/7.06 Simplify termination arguments: true 15.83/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.83/7.06 [2019-03-28 12:31:19,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.83/7.06 [2019-03-28 12:31:19,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.83/7.06 [2019-03-28 12:31:19,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.83/7.06 [2019-03-28 12:31:19,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.83/7.06 [2019-03-28 12:31:19,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.83/7.06 [2019-03-28 12:31:19,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.83/7.06 [2019-03-28 12:31:19,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.83/7.06 [2019-03-28 12:31:19,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.83/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.83/7.06 Number of strict supporting invariants: 0 15.83/7.06 Number of non-strict supporting invariants: 1 15.83/7.06 Consider only non-deceasing supporting invariants: true 15.83/7.06 Simplify termination arguments: true 15.83/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.83/7.06 [2019-03-28 12:31:19,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.83/7.06 [2019-03-28 12:31:19,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.83/7.06 [2019-03-28 12:31:19,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.83/7.06 [2019-03-28 12:31:19,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.83/7.06 [2019-03-28 12:31:19,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.83/7.06 [2019-03-28 12:31:19,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.83/7.06 [2019-03-28 12:31:19,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.83/7.06 [2019-03-28 12:31:19,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.83/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.83/7.06 Number of strict supporting invariants: 0 15.83/7.06 Number of non-strict supporting invariants: 1 15.83/7.06 Consider only non-deceasing supporting invariants: true 15.83/7.06 Simplify termination arguments: true 15.83/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.83/7.06 [2019-03-28 12:31:19,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.83/7.06 [2019-03-28 12:31:19,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.83/7.06 [2019-03-28 12:31:19,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.83/7.06 [2019-03-28 12:31:19,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.83/7.06 [2019-03-28 12:31:19,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.83/7.06 [2019-03-28 12:31:19,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.83/7.06 [2019-03-28 12:31:19,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.83/7.06 [2019-03-28 12:31:19,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.83/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.83/7.06 Number of strict supporting invariants: 0 15.83/7.06 Number of non-strict supporting invariants: 1 15.83/7.06 Consider only non-deceasing supporting invariants: true 15.83/7.06 Simplify termination arguments: true 15.83/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.83/7.06 [2019-03-28 12:31:19,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.83/7.06 [2019-03-28 12:31:19,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.83/7.06 [2019-03-28 12:31:19,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.83/7.06 [2019-03-28 12:31:19,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.83/7.06 [2019-03-28 12:31:19,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.83/7.06 [2019-03-28 12:31:19,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.83/7.06 [2019-03-28 12:31:19,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.83/7.06 [2019-03-28 12:31:19,375 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 15.83/7.06 [2019-03-28 12:31:19,380 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 15.83/7.06 [2019-03-28 12:31:19,380 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 15.83/7.06 [2019-03-28 12:31:19,382 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 15.83/7.06 [2019-03-28 12:31:19,382 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 15.83/7.06 [2019-03-28 12:31:19,382 INFO L518 LassoAnalysis]: Proved termination. 15.83/7.06 [2019-03-28 12:31:19,383 INFO L520 LassoAnalysis]: Termination argument consisting of: 15.83/7.06 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset)_1 + 1 15.83/7.06 Supporting invariants [] 15.83/7.06 [2019-03-28 12:31:19,395 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 15.83/7.06 [2019-03-28 12:31:19,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 15.83/7.06 [2019-03-28 12:31:19,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.83/7.06 [2019-03-28 12:31:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.83/7.06 [2019-03-28 12:31:19,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core 15.83/7.06 [2019-03-28 12:31:19,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.83/7.06 [2019-03-28 12:31:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.83/7.06 [2019-03-28 12:31:19,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core 15.83/7.06 [2019-03-28 12:31:19,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.83/7.06 [2019-03-28 12:31:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.83/7.06 [2019-03-28 12:31:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.83/7.06 [2019-03-28 12:31:19,526 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 15.83/7.06 [2019-03-28 12:31:19,527 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 15.83/7.06 [2019-03-28 12:31:19,530 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 15.83/7.06 [2019-03-28 12:31:19,531 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states. Second operand 4 states. 15.83/7.06 [2019-03-28 12:31:19,618 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states.. Second operand 4 states. Result 29 states and 57 transitions. Complement of second has 8 states. 15.83/7.06 [2019-03-28 12:31:19,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 15.83/7.06 [2019-03-28 12:31:19,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 15.83/7.06 [2019-03-28 12:31:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. 15.83/7.06 [2019-03-28 12:31:19,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 3 letters. 15.83/7.06 [2019-03-28 12:31:19,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.83/7.06 [2019-03-28 12:31:19,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 3 letters. 15.83/7.06 [2019-03-28 12:31:19,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.83/7.06 [2019-03-28 12:31:19,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 6 letters. 15.83/7.06 [2019-03-28 12:31:19,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.83/7.06 [2019-03-28 12:31:19,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 57 transitions. 15.83/7.06 [2019-03-28 12:31:19,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 15.83/7.06 [2019-03-28 12:31:19,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 5 states and 5 transitions. 15.83/7.06 [2019-03-28 12:31:19,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 15.83/7.06 [2019-03-28 12:31:19,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 15.83/7.06 [2019-03-28 12:31:19,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5 transitions. 15.83/7.06 [2019-03-28 12:31:19,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 15.83/7.06 [2019-03-28 12:31:19,636 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. 15.83/7.06 [2019-03-28 12:31:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 5 transitions. 15.83/7.06 [2019-03-28 12:31:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. 15.83/7.06 [2019-03-28 12:31:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 15.83/7.06 [2019-03-28 12:31:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. 15.83/7.06 [2019-03-28 12:31:19,638 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. 15.83/7.06 [2019-03-28 12:31:19,638 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. 15.83/7.06 [2019-03-28 12:31:19,638 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 15.83/7.06 [2019-03-28 12:31:19,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 5 transitions. 15.83/7.06 [2019-03-28 12:31:19,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 15.83/7.06 [2019-03-28 12:31:19,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 15.83/7.06 [2019-03-28 12:31:19,639 INFO L119 BuchiIsEmpty]: Starting construction of run 15.83/7.06 [2019-03-28 12:31:19,639 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 15.83/7.06 [2019-03-28 12:31:19,639 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 15.83/7.06 [2019-03-28 12:31:19,640 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 99#L-1 [57] L-1-->L12-3: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~p~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~p~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~p~0.base, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~p~0.offset] 100#L12-3 15.83/7.06 [2019-03-28 12:31:19,640 INFO L796 eck$LassoCheckResult]: Loop: 100#L12-3 [76] L12-3-->L13: Formula: (and (<= 0 v_ULTIMATE.start_main_~p~0.offset_12) (<= (+ v_ULTIMATE.start_main_~p~0.offset_12 4) (select |v_#length_11| v_ULTIMATE.start_main_~p~0.base_15)) (<= 0 (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~p~0.base_15) v_ULTIMATE.start_main_~p~0.offset_12)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~p~0.base_15) 1)) InVars {#valid=|v_#valid_13|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_15, #memory_int=|v_#memory_int_8|, #length=|v_#length_11|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_12} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_15, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_13|, #length=|v_#length_11|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 103#L13 [72] L13-->L13-2: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~p~0.base_13)) (<= (+ v_ULTIMATE.start_main_~p~0.offset_10 4) (select |v_#length_9| v_ULTIMATE.start_main_~p~0.base_13)) (<= 0 v_ULTIMATE.start_main_~p~0.offset_10) (= |v_ULTIMATE.start_main_#t~post3_5| |v_ULTIMATE.start_main_#t~mem2_5|) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~p~0.base_13) v_ULTIMATE.start_main_~p~0.offset_10) |v_ULTIMATE.start_main_#t~mem2_5|)) InVars {#valid=|v_#valid_11|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_13, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_10} OutVars{#valid=|v_#valid_11|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_5|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_13, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2] 102#L13-2 [75] L13-2-->L12-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~p~0.offset_11 4) (select |v_#length_10| v_ULTIMATE.start_main_~p~0.base_14)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~p~0.base_14)) (<= 0 v_ULTIMATE.start_main_~p~0.offset_11) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~p~0.base_14 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~p~0.base_14) v_ULTIMATE.start_main_~p~0.offset_11 (+ |v_ULTIMATE.start_main_#t~post3_7| (- 1)))))) InVars {#valid=|v_#valid_12|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_7|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_14, #length=|v_#length_10|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_11} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_14, #length=|v_#length_10|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2, #memory_int] 100#L12-3 15.83/7.06 [2019-03-28 12:31:19,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.83/7.06 [2019-03-28 12:31:19,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2196, now seen corresponding path program 1 times 15.83/7.06 [2019-03-28 12:31:19,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.83/7.06 [2019-03-28 12:31:19,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.83/7.06 [2019-03-28 12:31:19,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:19,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:19,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.83/7.06 [2019-03-28 12:31:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.83/7.06 [2019-03-28 12:31:19,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.83/7.06 [2019-03-28 12:31:19,652 INFO L82 PathProgramCache]: Analyzing trace with hash 105134, now seen corresponding path program 2 times 15.83/7.06 [2019-03-28 12:31:19,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.83/7.06 [2019-03-28 12:31:19,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.83/7.06 [2019-03-28 12:31:19,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:19,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:19,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.83/7.06 [2019-03-28 12:31:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.83/7.06 [2019-03-28 12:31:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.83/7.06 [2019-03-28 12:31:19,664 INFO L82 PathProgramCache]: Analyzing trace with hash 65496379, now seen corresponding path program 1 times 15.83/7.06 [2019-03-28 12:31:19,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.83/7.06 [2019-03-28 12:31:19,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.83/7.06 [2019-03-28 12:31:19,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:19,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:19,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.83/7.06 [2019-03-28 12:31:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.83/7.06 [2019-03-28 12:31:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.83/7.06 [2019-03-28 12:31:19,777 INFO L216 LassoAnalysis]: Preferences: 15.83/7.06 [2019-03-28 12:31:19,778 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 15.83/7.06 [2019-03-28 12:31:19,778 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 15.83/7.06 [2019-03-28 12:31:19,778 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 15.83/7.06 [2019-03-28 12:31:19,778 INFO L127 ssoRankerPreferences]: Use exernal solver: false 15.83/7.06 [2019-03-28 12:31:19,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 15.83/7.06 [2019-03-28 12:31:19,779 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 15.83/7.06 [2019-03-28 12:31:19,779 INFO L130 ssoRankerPreferences]: Path of dumped script: 15.83/7.06 [2019-03-28 12:31:19,779 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 15.83/7.06 [2019-03-28 12:31:19,779 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 15.83/7.06 [2019-03-28 12:31:19,779 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 15.83/7.06 [2019-03-28 12:31:19,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.83/7.06 [2019-03-28 12:31:19,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.83/7.06 [2019-03-28 12:31:19,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.83/7.06 [2019-03-28 12:31:19,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.83/7.06 [2019-03-28 12:31:19,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.83/7.06 [2019-03-28 12:31:19,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.83/7.06 [2019-03-28 12:31:19,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.83/7.06 [2019-03-28 12:31:20,006 INFO L300 LassoAnalysis]: Preprocessing complete. 15.83/7.06 [2019-03-28 12:31:20,007 INFO L497 LassoAnalysis]: Using template 'affine'. 15.83/7.06 [2019-03-28 12:31:20,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.83/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.83/7.06 Number of strict supporting invariants: 0 15.83/7.06 Number of non-strict supporting invariants: 1 15.83/7.06 Consider only non-deceasing supporting invariants: true 15.83/7.06 Simplify termination arguments: true 15.83/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.83/7.06 [2019-03-28 12:31:20,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.83/7.06 [2019-03-28 12:31:20,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.83/7.06 [2019-03-28 12:31:20,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.83/7.06 [2019-03-28 12:31:20,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.83/7.06 [2019-03-28 12:31:20,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.83/7.06 [2019-03-28 12:31:20,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.83/7.06 [2019-03-28 12:31:20,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.83/7.06 [2019-03-28 12:31:20,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.83/7.06 [2019-03-28 12:31:20,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.83/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.83/7.06 Number of strict supporting invariants: 0 15.83/7.06 Number of non-strict supporting invariants: 1 15.83/7.06 Consider only non-deceasing supporting invariants: true 15.83/7.06 Simplify termination arguments: true 15.83/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.83/7.06 [2019-03-28 12:31:20,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.83/7.06 [2019-03-28 12:31:20,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.83/7.06 [2019-03-28 12:31:20,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.83/7.06 [2019-03-28 12:31:20,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.83/7.06 [2019-03-28 12:31:20,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.83/7.06 [2019-03-28 12:31:20,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.83/7.06 [2019-03-28 12:31:20,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.83/7.06 [2019-03-28 12:31:20,015 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 15.83/7.06 [2019-03-28 12:31:20,017 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 15.83/7.06 [2019-03-28 12:31:20,018 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 15.83/7.06 [2019-03-28 12:31:20,018 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 15.83/7.06 [2019-03-28 12:31:20,018 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 15.83/7.06 [2019-03-28 12:31:20,019 INFO L518 LassoAnalysis]: Proved termination. 15.83/7.06 [2019-03-28 12:31:20,019 INFO L520 LassoAnalysis]: Termination argument consisting of: 15.83/7.06 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset)_2) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset)_2 + 1 15.83/7.06 Supporting invariants [] 15.83/7.06 [2019-03-28 12:31:20,029 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 15.83/7.06 [2019-03-28 12:31:20,030 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 15.83/7.06 [2019-03-28 12:31:20,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.83/7.06 [2019-03-28 12:31:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.83/7.06 [2019-03-28 12:31:20,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core 15.83/7.06 [2019-03-28 12:31:20,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.83/7.06 [2019-03-28 12:31:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.83/7.06 [2019-03-28 12:31:20,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core 15.83/7.06 [2019-03-28 12:31:20,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.83/7.06 [2019-03-28 12:31:20,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.83/7.06 [2019-03-28 12:31:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.83/7.06 [2019-03-28 12:31:20,153 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 15.83/7.06 [2019-03-28 12:31:20,153 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 15.83/7.06 [2019-03-28 12:31:20,154 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 15.83/7.06 [2019-03-28 12:31:20,154 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 5 transitions. cyclomatic complexity: 1 Second operand 4 states. 15.83/7.06 [2019-03-28 12:31:20,173 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 5 transitions. cyclomatic complexity: 1. Second operand 4 states. Result 8 states and 9 transitions. Complement of second has 6 states. 15.83/7.06 [2019-03-28 12:31:20,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 15.83/7.06 [2019-03-28 12:31:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 15.83/7.06 [2019-03-28 12:31:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. 15.83/7.06 [2019-03-28 12:31:20,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 3 letters. 15.83/7.06 [2019-03-28 12:31:20,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.83/7.06 [2019-03-28 12:31:20,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. 15.83/7.06 [2019-03-28 12:31:20,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.83/7.06 [2019-03-28 12:31:20,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. 15.83/7.06 [2019-03-28 12:31:20,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.83/7.06 [2019-03-28 12:31:20,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. 15.83/7.06 [2019-03-28 12:31:20,177 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 15.83/7.06 [2019-03-28 12:31:20,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. 15.83/7.06 [2019-03-28 12:31:20,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 15.83/7.06 [2019-03-28 12:31:20,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 15.83/7.06 [2019-03-28 12:31:20,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 15.83/7.06 [2019-03-28 12:31:20,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 15.83/7.06 [2019-03-28 12:31:20,178 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 15.83/7.06 [2019-03-28 12:31:20,178 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 15.83/7.06 [2019-03-28 12:31:20,178 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 15.83/7.06 [2019-03-28 12:31:20,179 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 15.83/7.06 [2019-03-28 12:31:20,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 15.83/7.07 [2019-03-28 12:31:20,179 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 15.83/7.07 [2019-03-28 12:31:20,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 15.83/7.07 [2019-03-28 12:31:20,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:31:20 BasicIcfg 15.83/7.07 [2019-03-28 12:31:20,185 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 15.83/7.07 [2019-03-28 12:31:20,185 INFO L168 Benchmark]: Toolchain (without parser) took 2748.52 ms. Allocated memory was 649.6 MB in the beginning and 752.9 MB in the end (delta: 103.3 MB). Free memory was 564.0 MB in the beginning and 698.5 MB in the end (delta: -134.5 MB). There was no memory consumed. Max. memory is 50.3 GB. 15.83/7.07 [2019-03-28 12:31:20,187 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 15.83/7.07 [2019-03-28 12:31:20,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.39 ms. Allocated memory was 649.6 MB in the beginning and 674.2 MB in the end (delta: 24.6 MB). Free memory was 564.0 MB in the beginning and 641.9 MB in the end (delta: -78.0 MB). Peak memory consumption was 29.8 MB. Max. memory is 50.3 GB. 15.83/7.07 [2019-03-28 12:31:20,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.32 ms. Allocated memory is still 674.2 MB. Free memory was 641.9 MB in the beginning and 637.5 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 50.3 GB. 15.83/7.07 [2019-03-28 12:31:20,189 INFO L168 Benchmark]: Boogie Preprocessor took 22.36 ms. Allocated memory is still 674.2 MB. Free memory was 637.5 MB in the beginning and 636.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 15.83/7.07 [2019-03-28 12:31:20,190 INFO L168 Benchmark]: RCFGBuilder took 248.26 ms. Allocated memory is still 674.2 MB. Free memory was 636.1 MB in the beginning and 619.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 50.3 GB. 15.83/7.07 [2019-03-28 12:31:20,190 INFO L168 Benchmark]: BlockEncodingV2 took 98.79 ms. Allocated memory is still 674.2 MB. Free memory was 619.1 MB in the beginning and 612.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. 15.83/7.07 [2019-03-28 12:31:20,191 INFO L168 Benchmark]: TraceAbstraction took 527.70 ms. Allocated memory is still 674.2 MB. Free memory was 612.4 MB in the beginning and 573.2 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 50.3 GB. 15.83/7.07 [2019-03-28 12:31:20,191 INFO L168 Benchmark]: BuchiAutomizer took 1508.55 ms. Allocated memory was 674.2 MB in the beginning and 752.9 MB in the end (delta: 78.6 MB). Free memory was 573.2 MB in the beginning and 698.5 MB in the end (delta: -125.3 MB). There was no memory consumed. Max. memory is 50.3 GB. 15.83/7.07 [2019-03-28 12:31:20,196 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 15.83/7.07 --- Results --- 15.83/7.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 15.83/7.07 - StatisticsResult: Initial Icfg 15.83/7.07 18 locations, 19 edges 15.83/7.07 - StatisticsResult: Encoded RCFG 15.83/7.07 11 locations, 18 edges 15.83/7.07 * Results from de.uni_freiburg.informatik.ultimate.core: 15.83/7.07 - StatisticsResult: Toolchain Benchmarks 15.83/7.07 Benchmark results are: 15.83/7.07 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 15.83/7.07 * CACSL2BoogieTranslator took 301.39 ms. Allocated memory was 649.6 MB in the beginning and 674.2 MB in the end (delta: 24.6 MB). Free memory was 564.0 MB in the beginning and 641.9 MB in the end (delta: -78.0 MB). Peak memory consumption was 29.8 MB. Max. memory is 50.3 GB. 15.83/7.07 * Boogie Procedure Inliner took 36.32 ms. Allocated memory is still 674.2 MB. Free memory was 641.9 MB in the beginning and 637.5 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 50.3 GB. 15.83/7.07 * Boogie Preprocessor took 22.36 ms. Allocated memory is still 674.2 MB. Free memory was 637.5 MB in the beginning and 636.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 15.83/7.07 * RCFGBuilder took 248.26 ms. Allocated memory is still 674.2 MB. Free memory was 636.1 MB in the beginning and 619.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 50.3 GB. 15.83/7.07 * BlockEncodingV2 took 98.79 ms. Allocated memory is still 674.2 MB. Free memory was 619.1 MB in the beginning and 612.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. 15.83/7.07 * TraceAbstraction took 527.70 ms. Allocated memory is still 674.2 MB. Free memory was 612.4 MB in the beginning and 573.2 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 50.3 GB. 15.83/7.07 * BuchiAutomizer took 1508.55 ms. Allocated memory was 674.2 MB in the beginning and 752.9 MB in the end (delta: 78.6 MB). Free memory was 573.2 MB in the beginning and 698.5 MB in the end (delta: -125.3 MB). There was no memory consumed. Max. memory is 50.3 GB. 15.83/7.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 15.83/7.07 - GenericResult: Unfinished Backtranslation 15.83/7.07 unknown boogie variable #length 15.83/7.07 - GenericResult: Unfinished Backtranslation 15.83/7.07 unknown boogie variable #length 15.83/7.07 - GenericResult: Unfinished Backtranslation 15.83/7.07 unknown boogie variable #memory_int 15.83/7.07 - GenericResult: Unfinished Backtranslation 15.83/7.07 unknown boogie variable #memory_int 15.83/7.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 15.83/7.07 - PositiveResult [Line: 13]: pointer dereference always succeeds 15.83/7.07 For all program executions holds that pointer dereference always succeeds at this location 15.83/7.07 - PositiveResult [Line: 13]: pointer dereference always succeeds 15.83/7.07 For all program executions holds that pointer dereference always succeeds at this location 15.83/7.07 - PositiveResult [Line: 13]: pointer dereference always succeeds 15.83/7.07 For all program executions holds that pointer dereference always succeeds at this location 15.83/7.07 - PositiveResult [Line: 12]: pointer dereference always succeeds 15.83/7.07 For all program executions holds that pointer dereference always succeeds at this location 15.83/7.07 - PositiveResult [Line: 13]: pointer dereference always succeeds 15.83/7.07 For all program executions holds that pointer dereference always succeeds at this location 15.83/7.07 - PositiveResult [Line: 12]: pointer dereference always succeeds 15.83/7.07 For all program executions holds that pointer dereference always succeeds at this location 15.83/7.07 - AllSpecificationsHoldResult: All specifications hold 15.83/7.07 6 specifications checked. All of them hold 15.83/7.07 - InvariantResult [Line: 12]: Loop Invariant 15.83/7.07 [2019-03-28 12:31:20,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 15.83/7.07 [2019-03-28 12:31:20,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 15.83/7.07 Derived loop invariant: (0 == p && 1 == \valid[p]) && 4 == unknown-#length-unknown[p] 15.83/7.07 - StatisticsResult: Ultimate Automizer benchmark data 15.83/7.07 CFG has 1 procedures, 11 locations, 6 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2 SDtfs, 12 SDslu, 1 SDs, 0 SdLazy, 17 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 14 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 15.83/7.07 - StatisticsResult: Constructed decomposition of program 15.83/7.07 Your program was decomposed into 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 4 locations. 15.83/7.07 - StatisticsResult: Timing statistics 15.83/7.07 BüchiAutomizer plugin needed 1.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 5 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 8 SDtfs, 53 SDslu, 0 SDs, 0 SdLazy, 71 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital85 mio100 ax100 hnf100 lsp92 ukn75 mio100 lsp41 div100 bol100 ite100 ukn100 eq179 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 15.83/7.07 - TerminationAnalysisResult: Termination proven 15.83/7.07 Buchi Automizer proved that your program is terminating 15.83/7.07 RESULT: Ultimate proved your program to be correct! 15.83/7.07 !SESSION 2019-03-28 12:31:14.175 ----------------------------------------------- 15.83/7.07 eclipse.buildId=unknown 15.83/7.07 java.version=1.8.0_181 15.83/7.07 java.vendor=Oracle Corporation 15.83/7.07 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 15.83/7.07 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 15.83/7.07 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 15.83/7.07 15.83/7.07 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:31:20.429 15.83/7.07 !MESSAGE The workspace will exit with unsaved changes in this session. 15.83/7.07 Received shutdown request... 15.83/7.07 Ultimate: 15.83/7.07 GTK+ Version Check 15.83/7.07 EOF