./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c06530bf-5225-4e0f-b1e5-362d28d55bda/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c06530bf-5225-4e0f-b1e5-362d28d55bda/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c06530bf-5225-4e0f-b1e5-362d28d55bda/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c06530bf-5225-4e0f-b1e5-362d28d55bda/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c06530bf-5225-4e0f-b1e5-362d28d55bda/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c06530bf-5225-4e0f-b1e5-362d28d55bda/bin/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.24-cad4683 [2019-10-22 08:57:34,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:34,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:34,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:34,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:34,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:34,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:34,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:34,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:34,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:34,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:34,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:34,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:34,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:34,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:34,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:34,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:34,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:34,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:34,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:34,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:34,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:34,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:34,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:34,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:34,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:34,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:34,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:34,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:34,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:34,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:34,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:34,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:34,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:34,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:34,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:34,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:34,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:34,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:34,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:34,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:34,641 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c06530bf-5225-4e0f-b1e5-362d28d55bda/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:57:34,652 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:34,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:34,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:34,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:34,654 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:34,654 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:34,654 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:34,654 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:34,655 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:34,655 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:34,655 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:34,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:34,655 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:34,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:34,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:34,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:34,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:34,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:34,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:34,656 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:34,657 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:34,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:34,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:34,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:34,657 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:34,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:34,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:34,658 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:34,659 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:34,659 INFO L138 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_c06530bf-5225-4e0f-b1e5-362d28d55bda/bin/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 [2019-10-22 08:57:34,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:34,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:34,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:34,695 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:34,696 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:34,696 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c06530bf-5225-4e0f-b1e5-362d28d55bda/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i [2019-10-22 08:57:34,740 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c06530bf-5225-4e0f-b1e5-362d28d55bda/bin/uautomizer/data/d5b3c3bc5/56150a64258a4b3f9d8b227503836849/FLAGf05a2c79d [2019-10-22 08:57:35,167 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:35,168 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c06530bf-5225-4e0f-b1e5-362d28d55bda/sv-benchmarks/c/termination-memory-alloca/stroeder2-alloca-2.i [2019-10-22 08:57:35,178 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c06530bf-5225-4e0f-b1e5-362d28d55bda/bin/uautomizer/data/d5b3c3bc5/56150a64258a4b3f9d8b227503836849/FLAGf05a2c79d [2019-10-22 08:57:35,508 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c06530bf-5225-4e0f-b1e5-362d28d55bda/bin/uautomizer/data/d5b3c3bc5/56150a64258a4b3f9d8b227503836849 [2019-10-22 08:57:35,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:35,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:35,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:35,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:35,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:35,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:35" (1/1) ... [2019-10-22 08:57:35,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4131fa89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:35, skipping insertion in model container [2019-10-22 08:57:35,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:35" (1/1) ... [2019-10-22 08:57:35,525 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:35,563 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:35,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:35,893 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:35,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:35,973 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:35,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:35 WrapperNode [2019-10-22 08:57:35,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:35,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:35,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:35,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:35,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:35" (1/1) ... [2019-10-22 08:57:35,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:35" (1/1) ... [2019-10-22 08:57:36,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:36,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:36,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:36,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:36,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:35" (1/1) ... [2019-10-22 08:57:36,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:35" (1/1) ... [2019-10-22 08:57:36,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:35" (1/1) ... [2019-10-22 08:57:36,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:35" (1/1) ... [2019-10-22 08:57:36,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:35" (1/1) ... [2019-10-22 08:57:36,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:35" (1/1) ... [2019-10-22 08:57:36,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:35" (1/1) ... [2019-10-22 08:57:36,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:36,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:36,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:36,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:36,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c06530bf-5225-4e0f-b1e5-362d28d55bda/bin/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 [2019-10-22 08:57:36,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:57:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:57:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:36,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:36,351 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:36,351 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:57:36,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:36 BoogieIcfgContainer [2019-10-22 08:57:36,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:36,353 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:36,353 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:36,355 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:36,356 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:36,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:35" (1/3) ... [2019-10-22 08:57:36,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b49517e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:36, skipping insertion in model container [2019-10-22 08:57:36,357 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:36,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:35" (2/3) ... [2019-10-22 08:57:36,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b49517e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:36, skipping insertion in model container [2019-10-22 08:57:36,357 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:36,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:36" (3/3) ... [2019-10-22 08:57:36,359 INFO L371 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca-2.i [2019-10-22 08:57:36,397 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:36,398 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:36,399 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:36,399 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:36,399 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:36,399 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:36,399 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:36,399 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:36,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-10-22 08:57:36,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:57:36,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:36,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:36,441 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:57:36,441 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:36,441 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:36,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-10-22 08:57:36,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:57:36,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:36,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:36,444 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:57:36,444 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:36,451 INFO L791 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.allocOnStack(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 [2019-10-22 08:57:36,451 INFO L793 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 [2019-10-22 08:57:36,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:36,456 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 08:57:36,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:36,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400992220] [2019-10-22 08:57:36,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:36,593 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:36,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:36,594 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2019-10-22 08:57:36,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:36,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607202351] [2019-10-22 08:57:36,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:36,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607202351] [2019-10-22 08:57:36,627 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:36,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:36,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765898969] [2019-10-22 08:57:36,632 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:57:36,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:36,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:57:36,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:57:36,649 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-10-22 08:57:36,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:36,655 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-10-22 08:57:36,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:57:36,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-10-22 08:57:36,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:57:36,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2019-10-22 08:57:36,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:57:36,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:57:36,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-10-22 08:57:36,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:36,665 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-10-22 08:57:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-10-22 08:57:36,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-10-22 08:57:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:57:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-10-22 08:57:36,682 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-10-22 08:57:36,682 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-10-22 08:57:36,683 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:36,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-10-22 08:57:36,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:57:36,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:36,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:36,684 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:57:36,684 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:57:36,684 INFO L791 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.allocOnStack(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 [2019-10-22 08:57:36,684 INFO L793 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 [2019-10-22 08:57:36,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:36,684 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-10-22 08:57:36,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:36,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024271068] [2019-10-22 08:57:36,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:36,717 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:36,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:36,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2019-10-22 08:57:36,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:36,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369327269] [2019-10-22 08:57:36,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:36,734 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:36,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:36,734 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2019-10-22 08:57:36,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:36,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018986423] [2019-10-22 08:57:36,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:36,781 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:36,987 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:36,987 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:36,987 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:36,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:36,988 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:36,988 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:36,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:36,988 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:36,988 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-2.i_Iteration2_Lasso [2019-10-22 08:57:36,988 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:36,988 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:37,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,389 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:37,394 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:37,396 INFO L120 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 [2019-10-22 08:57:37,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:37,397 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:37,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:37,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:37,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:37,400 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:37,400 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:37,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:37,403 INFO L120 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 [2019-10-22 08:57:37,404 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:37,404 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:37,404 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:37,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:37,409 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:37,412 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:37,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:37,430 INFO L120 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 [2019-10-22 08:57:37,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:37,431 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:37,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:37,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:37,433 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:37,433 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:37,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:37,445 INFO L120 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 [2019-10-22 08:57:37,446 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:37,446 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:37,447 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:37,447 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:37,447 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:37,447 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:37,447 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:37,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:37,452 INFO L120 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 [2019-10-22 08:57:37,453 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:37,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:37,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:37,454 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:37,462 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:37,468 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:37,534 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:37,572 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:57:37,582 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:37,584 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:37,585 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:37,586 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:37,587 INFO L512 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 [] [2019-10-22 08:57:37,594 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:57:37,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:37,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:37,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:37,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:37,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:37,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:37,674 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 [2019-10-22 08:57:37,676 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-10-22 08:57:37,704 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. [2019-10-22 08:57:37,704 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 [2019-10-22 08:57:37,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-10-22 08:57:37,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 08:57:37,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:37,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2019-10-22 08:57:37,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:37,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2019-10-22 08:57:37,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:37,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2019-10-22 08:57:37,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:37,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2019-10-22 08:57:37,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:57:37,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:57:37,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-10-22 08:57:37,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:37,711 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 08:57:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-10-22 08:57:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-10-22 08:57:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:57:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-10-22 08:57:37,713 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-10-22 08:57:37,713 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-10-22 08:57:37,713 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:37,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-10-22 08:57:37,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:37,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:37,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:37,714 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:37,714 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:37,715 INFO L791 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.allocOnStack(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 [2019-10-22 08:57:37,715 INFO L793 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 [2019-10-22 08:57:37,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:37,715 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-10-22 08:57:37,715 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:37,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458144557] [2019-10-22 08:57:37,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:37,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:37,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:37,733 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:37,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2019-10-22 08:57:37,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:37,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621194698] [2019-10-22 08:57:37,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:37,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:37,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:37,755 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:37,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:37,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-10-22 08:57:37,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:37,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013126503] [2019-10-22 08:57:37,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:37,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:37,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:37,803 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:37,991 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-10-22 08:57:38,051 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:38,051 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:38,051 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:38,051 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:38,051 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:38,051 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:38,051 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:38,052 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:38,052 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-2.i_Iteration3_Lasso [2019-10-22 08:57:38,052 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:38,052 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:38,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,200 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-22 08:57:38,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:38,486 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:38,486 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:38,486 INFO L120 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 [2019-10-22 08:57:38,487 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,505 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:38,505 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,505 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,505 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,506 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:38,506 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:38,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,509 INFO L120 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 [2019-10-22 08:57:38,509 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,509 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:38,509 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,510 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,510 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:38,510 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:38,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,511 INFO L120 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 [2019-10-22 08:57:38,511 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,512 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:38,512 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,512 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,512 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,512 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:38,512 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:38,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,513 INFO L120 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 [2019-10-22 08:57:38,514 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,516 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,517 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,517 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,518 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:38,519 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:38,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,522 INFO L120 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 [2019-10-22 08:57:38,522 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,522 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:38,522 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,522 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,523 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,523 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:38,523 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:38,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,524 INFO L120 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 [2019-10-22 08:57:38,524 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,525 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,525 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,525 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,526 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:38,528 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:38,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,534 INFO L120 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 [2019-10-22 08:57:38,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,535 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:38,535 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,535 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,536 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:38,536 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:38,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,537 INFO L120 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 [2019-10-22 08:57:38,537 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,537 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:38,537 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,537 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,538 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,540 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:38,540 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:38,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,545 INFO L120 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 [2019-10-22 08:57:38,547 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,547 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,547 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,547 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,548 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:38,548 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:38,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,552 INFO L120 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 [2019-10-22 08:57:38,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,553 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:38,553 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,553 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,553 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,553 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:38,554 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:38,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,555 INFO L120 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 [2019-10-22 08:57:38,555 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,555 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:57:38,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,556 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,557 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:38,558 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:38,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,588 INFO L120 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 [2019-10-22 08:57:38,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,591 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:38,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,592 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,592 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,592 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:38,592 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:38,594 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:38,600 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:57:38,600 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:38,600 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:38,600 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:57:38,601 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:38,601 INFO L512 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 [] [2019-10-22 08:57:38,612 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:57:38,615 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:57:38,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:38,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:38,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:38,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:57:38,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:38,660 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 [2019-10-22 08:57:38,660 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:57:38,682 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. [2019-10-22 08:57:38,682 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 [2019-10-22 08:57:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-10-22 08:57:38,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:57:38,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:38,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:57:38,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:38,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:57:38,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:38,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2019-10-22 08:57:38,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:38,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 21 transitions. [2019-10-22 08:57:38,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:57:38,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:57:38,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-10-22 08:57:38,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:38,688 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-10-22 08:57:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-10-22 08:57:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-10-22 08:57:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:57:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-10-22 08:57:38,689 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-10-22 08:57:38,689 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-10-22 08:57:38,690 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:57:38,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-10-22 08:57:38,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:57:38,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:38,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:38,691 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:38,691 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:38,691 INFO L791 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.allocOnStack(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 [2019-10-22 08:57:38,691 INFO L793 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 [2019-10-22 08:57:38,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2019-10-22 08:57:38,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618010781] [2019-10-22 08:57:38,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,717 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2019-10-22 08:57:38,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767820126] [2019-10-22 08:57:38,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,743 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:38,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2019-10-22 08:57:38,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980808298] [2019-10-22 08:57:38,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,778 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:38,965 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-10-22 08:57:39,032 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:39,032 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:39,032 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:39,032 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:39,032 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:39,032 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:39,032 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:39,032 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:39,032 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-2.i_Iteration4_Lasso [2019-10-22 08:57:39,033 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:39,033 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:39,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,526 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:39,526 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:39,526 INFO L120 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 [2019-10-22 08:57:39,527 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,527 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:39,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,528 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:39,528 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:39,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,529 INFO L120 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 [2019-10-22 08:57:39,529 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,530 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,531 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:39,531 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:39,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,533 INFO L120 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 [2019-10-22 08:57:39,534 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,534 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:39,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,534 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:39,535 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:39,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,535 INFO L120 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 [2019-10-22 08:57:39,536 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,537 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:39,537 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:39,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,543 INFO L120 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 [2019-10-22 08:57:39,543 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,543 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:39,543 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,544 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,544 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,544 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:39,544 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:39,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,545 INFO L120 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 [2019-10-22 08:57:39,545 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,545 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:39,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,546 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,546 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:39,546 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:39,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,547 INFO L120 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 [2019-10-22 08:57:39,548 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,548 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,548 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,548 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,549 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:39,550 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:39,555 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,555 INFO L120 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 [2019-10-22 08:57:39,556 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,556 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,556 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,556 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,558 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:39,559 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:39,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,570 INFO L120 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 [2019-10-22 08:57:39,570 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,570 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:39,571 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,571 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,571 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,571 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:39,571 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:39,573 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:39,574 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:57:39,574 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:39,574 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:39,575 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:57:39,575 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:39,575 INFO L512 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 [] [2019-10-22 08:57:39,594 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 08:57:39,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:57:39,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:39,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:57:39,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:39,643 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 [2019-10-22 08:57:39,643 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-10-22 08:57:39,660 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. [2019-10-22 08:57:39,660 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 [2019-10-22 08:57:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-10-22 08:57:39,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:57:39,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:39,662 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:57:39,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:39,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:57:39,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:39,697 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 [2019-10-22 08:57:39,697 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-10-22 08:57:39,710 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. [2019-10-22 08:57:39,711 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 [2019-10-22 08:57:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-10-22 08:57:39,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:57:39,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:39,712 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:57:39,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:39,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:57:39,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:39,755 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 [2019-10-22 08:57:39,756 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-10-22 08:57:39,770 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. [2019-10-22 08:57:39,770 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 [2019-10-22 08:57:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 08:57:39,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:57:39,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:39,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 08:57:39,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:39,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 08:57:39,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:39,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-10-22 08:57:39,774 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:39,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-10-22 08:57:39,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:57:39,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:57:39,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:57:39,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:39,774 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:39,775 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:39,775 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:39,775 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:57:39,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:39,775 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:39,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:57:39,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:57:39 BoogieIcfgContainer [2019-10-22 08:57:39,784 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:57:39,784 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:39,784 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:39,785 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:39,785 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:36" (3/4) ... [2019-10-22 08:57:39,788 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:57:39,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:39,790 INFO L168 Benchmark]: Toolchain (without parser) took 4278.53 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 939.1 MB in the beginning and 977.7 MB in the end (delta: -38.6 MB). Peak memory consumption was 187.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:39,791 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:39,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:39,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:39,792 INFO L168 Benchmark]: Boogie Preprocessor took 38.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:39,793 INFO L168 Benchmark]: RCFGBuilder took 295.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:39,793 INFO L168 Benchmark]: BuchiAutomizer took 3431.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 977.7 MB in the end (delta: 124.6 MB). Peak memory consumption was 200.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:39,795 INFO L168 Benchmark]: Witness Printer took 4.24 ms. Allocated memory is still 1.3 GB. Free memory is still 977.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:39,797 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 462.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 295.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3431.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 977.7 MB in the end (delta: 124.6 MB). Peak memory consumption was 200.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.24 ms. Allocated memory is still 1.3 GB. Free memory is still 977.7 MB. 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 3.3s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 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: inital131 mio100 ax113 hnf99 lsp79 ukn82 mio100 lsp56 div100 bol100 ite100 ukn100 eq193 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 6 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...