./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9aec6469-82f6-4196-a09a-72f0607d7614/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9aec6469-82f6-4196-a09a-72f0607d7614/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9aec6469-82f6-4196-a09a-72f0607d7614/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9aec6469-82f6-4196-a09a-72f0607d7614/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9aec6469-82f6-4196-a09a-72f0607d7614/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9aec6469-82f6-4196-a09a-72f0607d7614/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6b0415ceba0811795bdd9d25bfbda379c533d6bc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 12:40:41,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:40:41,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:40:41,584 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:40:41,584 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:40:41,584 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:40:41,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:40:41,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:40:41,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:40:41,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:40:41,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:40:41,588 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:40:41,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:40:41,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:40:41,589 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:40:41,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:40:41,590 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:40:41,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:40:41,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:40:41,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:40:41,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:40:41,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:40:41,594 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:40:41,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:40:41,595 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:40:41,595 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:40:41,596 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:40:41,596 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:40:41,596 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:40:41,597 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:40:41,597 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:40:41,597 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:40:41,597 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:40:41,598 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:40:41,598 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:40:41,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:40:41,599 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9aec6469-82f6-4196-a09a-72f0607d7614/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 12:40:41,606 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:40:41,606 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:40:41,607 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 12:40:41,607 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 12:40:41,607 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 12:40:41,607 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 12:40:41,607 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 12:40:41,607 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 12:40:41,608 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 12:40:41,608 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 12:40:41,608 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 12:40:41,608 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:40:41,608 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 12:40:41,608 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:40:41,608 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:40:41,608 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 12:40:41,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 12:40:41,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 12:40:41,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:40:41,609 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 12:40:41,609 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 12:40:41,609 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 12:40:41,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:40:41,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:40:41,609 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 12:40:41,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:40:41,609 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 12:40:41,609 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 12:40:41,610 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 12:40:41,610 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9aec6469-82f6-4196-a09a-72f0607d7614/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b0415ceba0811795bdd9d25bfbda379c533d6bc [2018-12-09 12:40:41,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:40:41,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:40:41,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:40:41,636 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:40:41,637 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:40:41,637 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9aec6469-82f6-4196-a09a-72f0607d7614/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca_true-termination.c.i [2018-12-09 12:40:41,672 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9aec6469-82f6-4196-a09a-72f0607d7614/bin-2019/uautomizer/data/9d276d985/36bd2fcfd56f46c09c98e2cc62c6a221/FLAGca5f6b88c [2018-12-09 12:40:42,132 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:40:42,133 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9aec6469-82f6-4196-a09a-72f0607d7614/sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca_true-termination.c.i [2018-12-09 12:40:42,140 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9aec6469-82f6-4196-a09a-72f0607d7614/bin-2019/uautomizer/data/9d276d985/36bd2fcfd56f46c09c98e2cc62c6a221/FLAGca5f6b88c [2018-12-09 12:40:42,150 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9aec6469-82f6-4196-a09a-72f0607d7614/bin-2019/uautomizer/data/9d276d985/36bd2fcfd56f46c09c98e2cc62c6a221 [2018-12-09 12:40:42,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:40:42,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:40:42,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:40:42,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:40:42,155 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:40:42,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:40:42" (1/1) ... [2018-12-09 12:40:42,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fec13c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:40:42, skipping insertion in model container [2018-12-09 12:40:42,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:40:42" (1/1) ... [2018-12-09 12:40:42,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:40:42,184 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:40:42,331 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:40:42,337 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:40:42,390 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:40:42,409 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:40:42,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:40:42 WrapperNode [2018-12-09 12:40:42,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:40:42,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:40:42,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:40:42,410 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:40:42,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:40:42" (1/1) ... [2018-12-09 12:40:42,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:40:42" (1/1) ... [2018-12-09 12:40:42,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:40:42,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:40:42,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:40:42,434 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:40:42,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:40:42" (1/1) ... [2018-12-09 12:40:42,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:40:42" (1/1) ... [2018-12-09 12:40:42,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:40:42" (1/1) ... [2018-12-09 12:40:42,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:40:42" (1/1) ... [2018-12-09 12:40:42,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:40:42" (1/1) ... [2018-12-09 12:40:42,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:40:42" (1/1) ... [2018-12-09 12:40:42,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:40:42" (1/1) ... [2018-12-09 12:40:42,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:40:42,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:40:42,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:40:42,448 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:40:42,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:40:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9aec6469-82f6-4196-a09a-72f0607d7614/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:40:42,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:40:42,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 12:40:42,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:40:42,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:40:42,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:40:42,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:40:42,593 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:40:42,593 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 12:40:42,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:40:42 BoogieIcfgContainer [2018-12-09 12:40:42,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:40:42,593 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 12:40:42,593 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 12:40:42,596 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 12:40:42,596 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 12:40:42,596 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 12:40:42" (1/3) ... [2018-12-09 12:40:42,597 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7062a24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:40:42, skipping insertion in model container [2018-12-09 12:40:42,597 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 12:40:42,597 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:40:42" (2/3) ... [2018-12-09 12:40:42,598 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7062a24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:40:42, skipping insertion in model container [2018-12-09 12:40:42,598 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 12:40:42,598 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:40:42" (3/3) ... [2018-12-09 12:40:42,599 INFO L375 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca_true-termination.c.i [2018-12-09 12:40:42,632 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 12:40:42,632 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 12:40:42,632 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 12:40:42,632 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 12:40:42,632 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:40:42,632 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:40:42,633 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 12:40:42,633 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:40:42,633 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 12:40:42,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-09 12:40:42,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:40:42,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:40:42,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:40:42,658 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 12:40:42,658 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 12:40:42,659 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 12:40:42,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-09 12:40:42,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:40:42,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:40:42,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:40:42,660 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 12:40:42,660 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 12:40:42,665 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 7#L564true assume !(main_~array_size~0 < 1); 10#L564-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 15#L552-3true [2018-12-09 12:40:42,665 INFO L796 eck$LassoCheckResult]: Loop: 15#L552-3true assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 9#L555-3true assume !true; 12#L552-2true sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 15#L552-3true [2018-12-09 12:40:42,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:42,668 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-09 12:40:42,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:40:42,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:40:42,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:42,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:40:42,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:42,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:42,741 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2018-12-09 12:40:42,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:40:42,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:40:42,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:42,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:40:42,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:40:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:40:42,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:40:42,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 12:40:42,763 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 12:40:42,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 12:40:42,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 12:40:42,773 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-12-09 12:40:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:40:42,777 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-09 12:40:42,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 12:40:42,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-12-09 12:40:42,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:40:42,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2018-12-09 12:40:42,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 12:40:42,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-09 12:40:42,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-12-09 12:40:42,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 12:40:42,782 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-09 12:40:42,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-12-09 12:40:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-09 12:40:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-09 12:40:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-09 12:40:42,798 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-09 12:40:42,798 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-09 12:40:42,799 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 12:40:42,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-12-09 12:40:42,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:40:42,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:40:42,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:40:42,799 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 12:40:42,799 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 12:40:42,800 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L564 assume !(main_~array_size~0 < 1); 36#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 40#L552-3 [2018-12-09 12:40:42,800 INFO L796 eck$LassoCheckResult]: Loop: 40#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 38#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 39#L555-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 41#L552-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 40#L552-3 [2018-12-09 12:40:42,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:42,800 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-12-09 12:40:42,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:40:42,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:40:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:42,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:40:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:42,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:42,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2018-12-09 12:40:42,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:40:42,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:40:42,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:42,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:40:42,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:42,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:42,820 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2018-12-09 12:40:42,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:40:42,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:40:42,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:42,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:40:42,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:42,967 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:40:42,968 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:40:42,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:40:42,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:40:42,968 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 12:40:42,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:40:42,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:40:42,968 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:40:42,968 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-09 12:40:42,968 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:40:42,968 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:40:42,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:42,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:42,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:42,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:42,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,226 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:40:43,229 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 12:40:43,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:43,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:43,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:43,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:43,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:43,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:43,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:43,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:43,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:43,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:40:43,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:40:43,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:43,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:43,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:43,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:40:43,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:40:43,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,251 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 12:40:43,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,253 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 12:40:43,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:40:43,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:43,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:43,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:43,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:40:43,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:40:43,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:40:43,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:40:43,297 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 12:40:43,313 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 12:40:43,314 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 12:40:43,315 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 12:40:43,316 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 12:40:43,316 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 12:40:43,317 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2018-12-09 12:40:43,320 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-09 12:40:43,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:40:43,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:40:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:40:43,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:40:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:40:43,366 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 12:40:43,366 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-09 12:40:43,386 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2018-12-09 12:40:43,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 12:40:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 12:40:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-09 12:40:43,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2018-12-09 12:40:43,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:40:43,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-09 12:40:43,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:40:43,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2018-12-09 12:40:43,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:40:43,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-12-09 12:40:43,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 12:40:43,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2018-12-09 12:40:43,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-09 12:40:43,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-09 12:40:43,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-12-09 12:40:43,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:40:43,391 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-09 12:40:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-12-09 12:40:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-09 12:40:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-09 12:40:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-12-09 12:40:43,392 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-12-09 12:40:43,392 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-12-09 12:40:43,392 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 12:40:43,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-12-09 12:40:43,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 12:40:43,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:40:43,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:40:43,393 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 12:40:43,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 12:40:43,393 INFO L794 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 103#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 104#L564 assume !(main_~array_size~0 < 1); 105#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 111#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 107#L555-3 [2018-12-09 12:40:43,393 INFO L796 eck$LassoCheckResult]: Loop: 107#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 108#L555-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; 107#L555-3 [2018-12-09 12:40:43,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:43,393 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-12-09 12:40:43,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:40:43,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:40:43,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:43,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:40:43,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:43,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:43,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-12-09 12:40:43,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:40:43,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:40:43,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:43,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:40:43,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:43,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:43,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-12-09 12:40:43,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:40:43,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:40:43,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:43,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:40:43,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:43,544 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:40:43,544 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:40:43,544 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:40:43,544 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:40:43,544 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 12:40:43,544 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:40:43,545 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:40:43,545 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:40:43,545 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-09 12:40:43,545 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:40:43,545 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:40:43,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:43,807 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:40:43,808 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 12:40:43,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:43,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:43,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:43,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:43,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:43,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:43,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:43,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:43,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:43,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:40:43,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:40:43,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:43,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:43,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:43,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:40:43,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:40:43,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:43,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:43,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:43,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:43,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:43,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:43,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:40:43,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:40:43,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:43,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:43,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:43,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:43,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:43,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:43,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:43,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:43,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:43,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:43,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:43,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:43,830 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 12:40:43,831 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 12:40:43,831 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 12:40:43,831 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 12:40:43,831 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 12:40:43,831 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 12:40:43,831 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2 Supporting invariants [] [2018-12-09 12:40:43,836 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 12:40:43,838 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 12:40:43,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:40:43,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:40:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:40:43,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:40:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:40:43,867 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 12:40:43,868 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-09 12:40:43,881 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 22 states and 29 transitions. Complement of second has 7 states. [2018-12-09 12:40:43,881 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 [2018-12-09 12:40:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 12:40:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-09 12:40:43,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-09 12:40:43,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:40:43,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-09 12:40:43,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:40:43,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-09 12:40:43,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:40:43,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2018-12-09 12:40:43,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 12:40:43,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 21 transitions. [2018-12-09 12:40:43,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-09 12:40:43,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-09 12:40:43,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2018-12-09 12:40:43,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:40:43,885 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-12-09 12:40:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2018-12-09 12:40:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-12-09 12:40:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-09 12:40:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-12-09 12:40:43,886 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-09 12:40:43,887 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-09 12:40:43,887 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 12:40:43,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-12-09 12:40:43,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 12:40:43,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:40:43,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:40:43,888 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:40:43,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 12:40:43,888 INFO L794 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 194#L564 assume !(main_~array_size~0 < 1); 195#L564-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 201#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 204#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 205#L555-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 202#L552-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 203#L552-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 197#L555-3 [2018-12-09 12:40:43,888 INFO L796 eck$LassoCheckResult]: Loop: 197#L555-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 198#L555-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; 197#L555-3 [2018-12-09 12:40:43,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:43,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2018-12-09 12:40:43,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:40:43,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:40:43,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:43,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:40:43,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:43,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:43,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-12-09 12:40:43,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:40:43,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:40:43,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:43,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:40:43,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:43,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:43,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2018-12-09 12:40:43,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:40:43,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:40:43,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:43,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:40:43,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:40:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:40:44,077 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2018-12-09 12:40:44,107 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:40:44,107 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:40:44,107 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:40:44,107 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:40:44,107 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 12:40:44,108 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:40:44,108 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:40:44,108 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:40:44,108 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-09 12:40:44,108 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:40:44,108 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:40:44,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:40:44,366 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:40:44,366 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 12:40:44,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:44,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:44,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:44,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:44,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:44,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:44,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:44,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:44,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:44,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:44,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:44,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:44,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:44,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:44,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:40:44,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:40:44,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:44,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:44,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:44,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:44,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:44,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:44,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:44,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:44,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:44,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:44,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:44,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:44,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:44,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:44,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:44,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:40:44,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:40:44,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:44,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:44,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:44,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:44,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:44,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:44,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:44,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:44,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:44,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:44,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:44,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:44,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:44,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:44,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:44,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:44,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:44,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:44,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:44,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:44,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:44,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:44,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:44,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:44,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:44,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:44,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:44,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:44,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:44,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:44,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:44,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:44,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:44,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:40:44,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:40:44,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:44,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:44,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:44,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:44,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:44,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:44,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:40:44,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:40:44,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:40:44,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:40:44,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:40:44,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:40:44,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:40:44,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:40:44,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:40:44,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:40:44,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:40:44,407 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 12:40:44,408 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 12:40:44,408 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 12:40:44,408 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 12:40:44,408 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 12:40:44,408 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 12:40:44,409 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3 Supporting invariants [] [2018-12-09 12:40:44,420 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-12-09 12:40:44,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 12:40:44,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:40:44,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:40:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:40:44,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:40:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:40:44,467 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 12:40:44,467 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-09 12:40:44,480 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2018-12-09 12:40:44,481 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 [2018-12-09 12:40:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 12:40:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-09 12:40:44,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-09 12:40:44,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:40:44,482 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 12:40:44,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:40:44,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:40:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:40:44,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:40:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:40:44,511 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 12:40:44,511 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-09 12:40:44,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2018-12-09 12:40:44,519 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 [2018-12-09 12:40:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 12:40:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-09 12:40:44,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-09 12:40:44,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:40:44,520 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 12:40:44,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:40:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:40:44,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:40:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:40:44,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:40:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:40:44,547 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 2 loop predicates [2018-12-09 12:40:44,548 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-09 12:40:44,559 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2018-12-09 12:40:44,560 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 [2018-12-09 12:40:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 12:40:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-09 12:40:44,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-09 12:40:44,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:40:44,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-09 12:40:44,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:40:44,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-09 12:40:44,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:40:44,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2018-12-09 12:40:44,562 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 12:40:44,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2018-12-09 12:40:44,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 12:40:44,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 12:40:44,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 12:40:44,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 12:40:44,562 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 12:40:44,562 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 12:40:44,562 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 12:40:44,562 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 12:40:44,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 12:40:44,562 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 12:40:44,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 12:40:44,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 12:40:44 BoogieIcfgContainer [2018-12-09 12:40:44,566 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 12:40:44,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:40:44,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:40:44,566 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:40:44,567 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:40:42" (3/4) ... [2018-12-09 12:40:44,569 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 12:40:44,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:40:44,569 INFO L168 Benchmark]: Toolchain (without parser) took 2417.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 951.7 MB in the beginning and 1.0 GB in the end (delta: -67.3 MB). Peak memory consumption was 137.1 MB. Max. memory is 11.5 GB. [2018-12-09 12:40:44,570 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:40:44,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -120.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-09 12:40:44,570 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-09 12:40:44,571 INFO L168 Benchmark]: Boogie Preprocessor took 13.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:40:44,571 INFO L168 Benchmark]: RCFGBuilder took 145.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-12-09 12:40:44,571 INFO L168 Benchmark]: BuchiAutomizer took 1972.62 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 118.5 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 30.4 MB). Peak memory consumption was 148.9 MB. Max. memory is 11.5 GB. [2018-12-09 12:40:44,571 INFO L168 Benchmark]: Witness Printer took 2.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:40:44,573 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -120.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 145.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1972.62 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 118.5 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 30.4 MB). Peak memory consumption was 148.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 59 SDtfs, 44 SDslu, 10 SDs, 0 SdLazy, 32 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital127 mio100 ax114 hnf99 lsp78 ukn82 mio100 lsp57 div100 bol100 ite100 ukn100 eq193 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...