./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.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/run_dir_96aa9a64-0858-4c21-b42f-67ea1356ef31/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_96aa9a64-0858-4c21-b42f-67ea1356ef31/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_96aa9a64-0858-4c21-b42f-67ea1356ef31/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_96aa9a64-0858-4c21-b42f-67ea1356ef31/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_96aa9a64-0858-4c21-b42f-67ea1356ef31/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_96aa9a64-0858-4c21-b42f-67ea1356ef31/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 14310793a2daa3bf62d53b5cef67b6406903d242 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:26:10,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:26:10,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:26:10,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:26:10,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:26:10,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:26:10,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:26:10,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:26:10,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:26:10,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:26:10,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:26:10,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:26:10,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:26:10,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:26:10,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:26:10,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:26:10,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:26:10,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:26:10,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:26:10,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:26:10,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:26:10,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:26:10,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:26:10,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:26:10,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:26:10,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:26:10,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:26:10,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:26:10,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:26:10,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:26:10,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:26:10,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:26:10,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:26:10,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:26:10,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:26:10,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:26:10,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:26:10,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:26:10,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:26:10,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:26:10,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:26:10,723 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_96aa9a64-0858-4c21-b42f-67ea1356ef31/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:26:10,749 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:26:10,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:26:10,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:26:10,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:26:10,751 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:26:10,751 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:26:10,751 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:26:10,751 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:26:10,751 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:26:10,752 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:26:10,752 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:26:10,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:26:10,752 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:26:10,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:26:10,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:26:10,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:26:10,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:26:10,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:26:10,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:26:10,754 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:26:10,754 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:26:10,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:26:10,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:26:10,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:26:10,755 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:26:10,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:26:10,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:26:10,755 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:26:10,756 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:26:10,756 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/run_dir_96aa9a64-0858-4c21-b42f-67ea1356ef31/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 -> 14310793a2daa3bf62d53b5cef67b6406903d242 [2019-11-15 23:26:10,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:26:10,813 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:26:10,817 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:26:10,818 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:26:10,819 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:26:10,819 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_96aa9a64-0858-4c21-b42f-67ea1356ef31/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2019-11-15 23:26:10,890 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_96aa9a64-0858-4c21-b42f-67ea1356ef31/bin/uautomizer/data/a0bcda635/f87adc10c11a42349ea075c7be00612f/FLAG0a4d259c9 [2019-11-15 23:26:11,316 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:26:11,317 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_96aa9a64-0858-4c21-b42f-67ea1356ef31/sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2019-11-15 23:26:11,333 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_96aa9a64-0858-4c21-b42f-67ea1356ef31/bin/uautomizer/data/a0bcda635/f87adc10c11a42349ea075c7be00612f/FLAG0a4d259c9 [2019-11-15 23:26:11,616 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_96aa9a64-0858-4c21-b42f-67ea1356ef31/bin/uautomizer/data/a0bcda635/f87adc10c11a42349ea075c7be00612f [2019-11-15 23:26:11,619 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:26:11,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:26:11,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:11,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:26:11,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:26:11,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:11" (1/1) ... [2019-11-15 23:26:11,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab9422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:11, skipping insertion in model container [2019-11-15 23:26:11,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:11" (1/1) ... [2019-11-15 23:26:11,637 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:26:11,686 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:26:12,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:26:12,095 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:26:12,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:26:12,185 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:26:12,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:12 WrapperNode [2019-11-15 23:26:12,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:12,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:26:12,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:26:12,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:26:12,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:12" (1/1) ... [2019-11-15 23:26:12,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:12" (1/1) ... [2019-11-15 23:26:12,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:26:12,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:26:12,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:26:12,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:26:12,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:12" (1/1) ... [2019-11-15 23:26:12,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:12" (1/1) ... [2019-11-15 23:26:12,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:12" (1/1) ... [2019-11-15 23:26:12,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:12" (1/1) ... [2019-11-15 23:26:12,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:12" (1/1) ... [2019-11-15 23:26:12,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:12" (1/1) ... [2019-11-15 23:26:12,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:12" (1/1) ... [2019-11-15 23:26:12,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:26:12,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:26:12,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:26:12,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:26:12,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96aa9a64-0858-4c21-b42f-67ea1356ef31/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-11-15 23:26:12,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:26:12,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:26:12,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:26:12,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:26:12,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:26:12,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:26:12,594 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:26:12,594 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:26:12,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:12 BoogieIcfgContainer [2019-11-15 23:26:12,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:26:12,596 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:26:12,596 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:26:12,599 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:26:12,601 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:26:12,601 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:26:11" (1/3) ... [2019-11-15 23:26:12,602 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42fc32f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:26:12, skipping insertion in model container [2019-11-15 23:26:12,602 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:26:12,602 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:12" (2/3) ... [2019-11-15 23:26:12,602 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42fc32f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:26:12, skipping insertion in model container [2019-11-15 23:26:12,603 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:26:12,603 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:12" (3/3) ... [2019-11-15 23:26:12,604 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.14-alloca.i [2019-11-15 23:26:12,653 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:26:12,653 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:26:12,654 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:26:12,654 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:26:12,654 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:26:12,654 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:26:12,654 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:26:12,654 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:26:12,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 23:26:12,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:26:12,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:26:12,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:26:12,693 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:26:12,693 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:26:12,694 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:26:12,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 23:26:12,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:26:12,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:26:12,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:26:12,695 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:26:12,696 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:26:12,703 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6#L556-4true [2019-11-15 23:26:12,703 INFO L793 eck$LassoCheckResult]: Loop: 6#L556-4true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 14#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 7#L555-3true assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8; 4#L556-3true assume !true; 6#L556-4true [2019-11-15 23:26:12,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:12,709 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 23:26:12,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:12,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327015798] [2019-11-15 23:26:12,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:12,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:12,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:12,877 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:12,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1142256, now seen corresponding path program 1 times [2019-11-15 23:26:12,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:12,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026209763] [2019-11-15 23:26:12,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:12,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:12,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:12,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026209763] [2019-11-15 23:26:12,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:12,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-15 23:26:12,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247355045] [2019-11-15 23:26:12,937 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:26:12,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:12,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:26:12,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:26:12,953 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-11-15 23:26:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:12,957 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-11-15 23:26:12,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:26:12,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-11-15 23:26:12,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:26:12,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 9 transitions. [2019-11-15 23:26:12,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 23:26:12,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 23:26:12,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2019-11-15 23:26:12,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:26:12,964 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-15 23:26:12,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2019-11-15 23:26:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-15 23:26:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:26:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-15 23:26:12,988 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-15 23:26:12,988 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-15 23:26:12,988 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:26:12,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-11-15 23:26:12,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:26:12,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:26:12,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:26:12,989 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:26:12,989 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:26:12,990 INFO L791 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L556-4 [2019-11-15 23:26:12,990 INFO L793 eck$LassoCheckResult]: Loop: 33#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 37#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 38#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8; 34#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 35#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 33#L556-4 [2019-11-15 23:26:12,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:12,990 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-15 23:26:12,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:12,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269069131] [2019-11-15 23:26:12,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:12,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:12,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:13,037 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:13,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:13,038 INFO L82 PathProgramCache]: Analyzing trace with hash 35409745, now seen corresponding path program 1 times [2019-11-15 23:26:13,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:13,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496609436] [2019-11-15 23:26:13,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:13,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:13,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:13,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496609436] [2019-11-15 23:26:13,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:13,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:26:13,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341902917] [2019-11-15 23:26:13,145 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:26:13,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:13,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:26:13,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:26:13,146 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-11-15 23:26:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:13,262 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-11-15 23:26:13,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:26:13,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-11-15 23:26:13,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 23:26:13,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2019-11-15 23:26:13,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 23:26:13,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 23:26:13,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-11-15 23:26:13,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:26:13,265 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-15 23:26:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-11-15 23:26:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-15 23:26:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 23:26:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-11-15 23:26:13,267 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-15 23:26:13,267 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-15 23:26:13,267 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:26:13,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-11-15 23:26:13,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 23:26:13,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:26:13,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:26:13,268 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:26:13,269 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-11-15 23:26:13,269 INFO L791 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 64#L556-4 [2019-11-15 23:26:13,269 INFO L793 eck$LassoCheckResult]: Loop: 64#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 68#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 69#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8; 65#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 66#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 70#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 71#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 64#L556-4 [2019-11-15 23:26:13,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:13,269 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-15 23:26:13,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:13,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628375276] [2019-11-15 23:26:13,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:13,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:13,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:13,329 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:13,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:13,329 INFO L82 PathProgramCache]: Analyzing trace with hash -330970762, now seen corresponding path program 1 times [2019-11-15 23:26:13,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:13,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169024167] [2019-11-15 23:26:13,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:13,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:13,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:13,375 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:13,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:13,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2019-11-15 23:26:13,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:13,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911062079] [2019-11-15 23:26:13,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:13,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:13,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:13,457 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:13,710 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-11-15 23:26:14,236 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-11-15 23:26:14,427 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-15 23:26:14,439 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:26:14,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:26:14,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:26:14,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:26:14,440 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:26:14,440 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:26:14,440 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:26:14,440 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:26:14,441 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.14-alloca.i_Iteration3_Lasso [2019-11-15 23:26:14,441 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:26:14,441 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:26:14,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:14,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:14,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:14,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:14,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:14,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:14,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:14,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:14,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:14,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:14,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:14,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:14,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:14,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:14,979 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-11-15 23:26:15,163 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-11-15 23:26:15,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:15,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:15,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:15,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-11-15 23:26:16,057 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 23:26:16,117 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:26:16,122 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:26:16,124 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-11-15 23:26:16,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:16,126 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:16,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:16,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:16,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:16,129 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:16,129 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:16,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:16,132 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-11-15 23:26:16,132 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:16,132 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:16,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:16,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:16,133 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:16,133 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:16,133 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:16,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:16,134 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-11-15 23:26:16,135 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:16,135 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:16,135 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:16,136 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:16,136 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:16,136 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:16,136 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:16,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:16,137 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-11-15 23:26:16,138 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:16,138 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:16,138 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:16,138 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:16,138 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:16,139 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:16,139 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:16,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:16,140 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-11-15 23:26:16,141 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:16,141 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:16,141 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:16,141 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:16,141 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:16,142 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:16,142 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:16,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:16,143 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-11-15 23:26:16,144 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:16,144 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:16,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:16,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:16,146 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:16,146 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:16,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:16,149 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-11-15 23:26:16,150 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:16,150 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:16,150 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:16,150 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:16,151 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:16,151 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:16,151 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:16,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:16,152 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-11-15 23:26:16,153 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:16,153 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:16,153 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:16,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:16,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:16,154 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:16,154 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:16,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:16,155 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-11-15 23:26:16,156 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:16,156 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:16,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:16,156 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:16,156 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:16,157 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:16,157 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:16,157 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:16,158 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-11-15 23:26:16,158 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:16,159 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:16,159 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:16,159 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:16,160 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:16,160 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:16,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:16,164 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-11-15 23:26:16,165 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:16,165 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:16,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:16,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:16,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:16,166 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:16,166 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:16,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:16,167 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-11-15 23:26:16,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:16,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:16,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:16,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:16,169 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:16,170 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:16,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:16,172 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-11-15 23:26:16,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:16,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:16,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:16,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:16,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:16,174 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:16,174 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:16,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:16,175 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-11-15 23:26:16,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:16,176 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:16,176 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:16,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:16,181 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:16,181 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:16,202 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:26:16,219 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:26:16,219 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:26:16,221 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:26:16,223 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:26:16,223 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:26:16,224 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2019-11-15 23:26:16,302 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 23:26:16,307 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:26:16,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:16,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:26:16,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:16,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:26:16,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:16,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 23:26:16,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:26:16,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:26:16,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:26:16,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:3 [2019-11-15 23:26:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:16,442 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 23:26:16,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-11-15 23:26:16,568 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand 6 states. Result 16 states and 21 transitions. Complement of second has 10 states. [2019-11-15 23:26:16,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 23:26:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:26:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-11-15 23:26:16,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 2 letters. Loop has 7 letters. [2019-11-15 23:26:16,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:16,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 9 letters. Loop has 7 letters. [2019-11-15 23:26:16,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:16,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 2 letters. Loop has 14 letters. [2019-11-15 23:26:16,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:16,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2019-11-15 23:26:16,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:26:16,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2019-11-15 23:26:16,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 23:26:16,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 23:26:16,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-15 23:26:16,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:26:16,576 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 23:26:16,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-15 23:26:16,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-11-15 23:26:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 23:26:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-15 23:26:16,579 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 23:26:16,579 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 23:26:16,579 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:26:16,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-15 23:26:16,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:26:16,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:26:16,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:26:16,580 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:26:16,580 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:26:16,581 INFO L791 eck$LassoCheckResult]: Stem: 251#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 245#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 246#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 253#L555-1 assume !test_fun_#t~short8; 255#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8; 247#L556-3 [2019-11-15 23:26:16,581 INFO L793 eck$LassoCheckResult]: Loop: 247#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 248#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 247#L556-3 [2019-11-15 23:26:16,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:16,581 INFO L82 PathProgramCache]: Analyzing trace with hash 28695850, now seen corresponding path program 1 times [2019-11-15 23:26:16,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:16,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340875200] [2019-11-15 23:26:16,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:16,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:16,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:16,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340875200] [2019-11-15 23:26:16,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:16,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:26:16,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794170033] [2019-11-15 23:26:16,604 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:26:16,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:16,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2019-11-15 23:26:16,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:16,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832611789] [2019-11-15 23:26:16,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:16,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:16,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:16,617 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:16,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:16,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:26:16,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:26:16,705 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 23:26:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:16,717 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-11-15 23:26:16,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:26:16,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2019-11-15 23:26:16,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:26:16,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 17 transitions. [2019-11-15 23:26:16,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 23:26:16,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 23:26:16,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-11-15 23:26:16,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:26:16,720 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-15 23:26:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-11-15 23:26:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 23:26:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 23:26:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-15 23:26:16,722 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-15 23:26:16,722 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-15 23:26:16,722 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:26:16,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-11-15 23:26:16,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:26:16,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:26:16,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:26:16,723 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:26:16,723 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:26:16,723 INFO L791 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 281#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 282#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 289#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 291#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8; 283#L556-3 [2019-11-15 23:26:16,723 INFO L793 eck$LassoCheckResult]: Loop: 283#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 284#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 283#L556-3 [2019-11-15 23:26:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:16,724 INFO L82 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2019-11-15 23:26:16,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:16,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98303727] [2019-11-15 23:26:16,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:16,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:16,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:16,765 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 2 times [2019-11-15 23:26:16,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:16,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693498360] [2019-11-15 23:26:16,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:16,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:16,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:16,780 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:16,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:16,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849233, now seen corresponding path program 1 times [2019-11-15 23:26:16,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:16,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904471913] [2019-11-15 23:26:16,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:16,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:16,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:16,825 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:17,345 WARN L191 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 102 [2019-11-15 23:26:17,508 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-15 23:26:17,511 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:26:17,511 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:26:17,511 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:26:17,511 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:26:17,511 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:26:17,511 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:26:17,511 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:26:17,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:26:17,512 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.14-alloca.i_Iteration5_Lasso [2019-11-15 23:26:17,512 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:26:17,512 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:26:17,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,846 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-11-15 23:26:17,969 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 23:26:17,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:17,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:18,835 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 23:26:18,863 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:26:18,863 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:26:18,863 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-11-15 23:26:18,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,864 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:18,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,865 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,865 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,865 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:18,866 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:18,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,867 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-11-15 23:26:18,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,868 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,874 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:18,874 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:18,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,876 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-11-15 23:26:18,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,884 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:18,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,885 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:18,885 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:18,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,886 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-11-15 23:26:18,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,887 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,888 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:18,888 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:18,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,891 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-11-15 23:26:18,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,896 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:18,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,897 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:18,897 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:18,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,898 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-11-15 23:26:18,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,899 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:18,899 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,899 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:18,900 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:18,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,901 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-11-15 23:26:18,902 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,902 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:18,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,902 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,903 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:18,903 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:18,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,904 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-11-15 23:26:18,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,905 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:18,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,906 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:18,906 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:18,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,907 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-11-15 23:26:18,908 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,908 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,908 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,909 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,909 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:18,910 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:18,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,913 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-11-15 23:26:18,915 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,915 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,915 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,915 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,920 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:18,920 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:18,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,924 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-11-15 23:26:18,925 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,925 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:18,925 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,925 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,925 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,926 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:18,926 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:18,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,927 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-11-15 23:26:18,928 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,928 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:18,928 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,928 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,928 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,929 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:18,929 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:18,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,930 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-11-15 23:26:18,930 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,931 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,932 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:18,932 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:18,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,935 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-11-15 23:26:18,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,935 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,936 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,936 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,937 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:18,938 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:18,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,947 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-11-15 23:26:18,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,950 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:18,950 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:18,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:18,952 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-11-15 23:26:18,953 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:18,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:18,955 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:18,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:18,957 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:18,957 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:18,994 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:26:19,009 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:26:19,011 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 23:26:19,012 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:26:19,012 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:26:19,013 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:26:19,013 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2019-11-15 23:26:19,127 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 23:26:19,129 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:26:19,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:19,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 23:26:19,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:19,242 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:26:19,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 92 [2019-11-15 23:26:19,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:26:19,303 INFO L567 ElimStorePlain]: treesize reduction 51, result has 46.9 percent of original size [2019-11-15 23:26:19,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:26:19,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:12 [2019-11-15 23:26:19,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:19,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:19,387 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:26:19,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 42 [2019-11-15 23:26:19,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:19,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:19,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:19,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:19,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:26:19,428 INFO L567 ElimStorePlain]: treesize reduction 1, result has 97.0 percent of original size [2019-11-15 23:26:19,445 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:26:19,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 43 [2019-11-15 23:26:19,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:19,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:19,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:19,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:19,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:19,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:26:19,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:26:19,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 23:26:19,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:51, output treesize:19 [2019-11-15 23:26:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:19,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:26:19,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:26:19,541 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-11-15 23:26:19,541 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-15 23:26:19,759 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 32 states and 37 transitions. Complement of second has 9 states. [2019-11-15 23:26:19,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:26:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:26:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2019-11-15 23:26:19,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 23:26:19,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:19,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 23:26:19,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:19,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 23:26:19,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:19,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-11-15 23:26:19,762 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:26:19,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-11-15 23:26:19,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:26:19,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:26:19,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:26:19,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:26:19,763 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:26:19,763 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:26:19,763 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:26:19,763 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:26:19,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:26:19,763 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:26:19,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:26:19,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:26:19 BoogieIcfgContainer [2019-11-15 23:26:19,768 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:26:19,769 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:26:19,769 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:26:19,769 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:26:19,770 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:12" (3/4) ... [2019-11-15 23:26:19,773 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:26:19,773 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:26:19,774 INFO L168 Benchmark]: Toolchain (without parser) took 8154.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -77.6 MB). Peak memory consumption was 116.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:19,775 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:26:19,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 565.40 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.4 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:19,776 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:26:19,777 INFO L168 Benchmark]: Boogie Preprocessor took 32.77 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:19,777 INFO L168 Benchmark]: RCFGBuilder took 333.98 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:19,778 INFO L168 Benchmark]: BuchiAutomizer took 7172.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 44.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.9 MB). Peak memory consumption was 135.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:19,778 INFO L168 Benchmark]: Witness Printer took 4.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:26:19,781 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 565.40 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.4 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.77 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 333.98 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7172.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 44.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.9 MB). Peak memory consumption was 135.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 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, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 34 SDtfs, 16 SDslu, 21 SDs, 0 SdLazy, 64 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital452 mio100 ax103 hnf100 lsp94 ukn43 mio100 lsp35 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf293 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...