./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.05-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8ba1320d-89f4-4cad-8dc3-8b66d2ed28c3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8ba1320d-89f4-4cad-8dc3-8b66d2ed28c3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8ba1320d-89f4-4cad-8dc3-8b66d2ed28c3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8ba1320d-89f4-4cad-8dc3-8b66d2ed28c3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.05-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8ba1320d-89f4-4cad-8dc3-8b66d2ed28c3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8ba1320d-89f4-4cad-8dc3-8b66d2ed28c3/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f1e9ba7e316537618e1819aa49662575d0a5a8e7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:24:09,603 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:24:09,604 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:24:09,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:24:09,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:24:09,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:24:09,613 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:24:09,614 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:24:09,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:24:09,615 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:24:09,616 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:24:09,616 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:24:09,617 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:24:09,618 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:24:09,618 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:24:09,619 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:24:09,619 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:24:09,621 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:24:09,622 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:24:09,623 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:24:09,624 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:24:09,624 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:24:09,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:24:09,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:24:09,626 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:24:09,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:24:09,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:24:09,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:24:09,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:24:09,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:24:09,629 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:24:09,630 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:24:09,630 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:24:09,630 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:24:09,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:24:09,631 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:24:09,631 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8ba1320d-89f4-4cad-8dc3-8b66d2ed28c3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 21:24:09,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:24:09,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:24:09,643 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:24:09,643 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:24:09,643 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:24:09,643 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 21:24:09,643 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 21:24:09,643 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 21:24:09,643 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 21:24:09,644 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 21:24:09,644 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 21:24:09,644 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:24:09,644 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 21:24:09,644 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:24:09,644 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:24:09,644 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 21:24:09,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 21:24:09,645 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 21:24:09,645 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:24:09,645 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 21:24:09,645 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:24:09,645 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 21:24:09,645 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:24:09,646 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:24:09,646 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 21:24:09,646 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:24:09,646 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:24:09,646 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 21:24:09,647 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 21:24:09,647 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8ba1320d-89f4-4cad-8dc3-8b66d2ed28c3/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1e9ba7e316537618e1819aa49662575d0a5a8e7 [2018-11-22 21:24:09,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:24:09,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:24:09,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:24:09,684 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:24:09,684 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:24:09,685 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8ba1320d-89f4-4cad-8dc3-8b66d2ed28c3/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.05-alloca_true-termination_true-no-overflow.c.i [2018-11-22 21:24:09,728 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ba1320d-89f4-4cad-8dc3-8b66d2ed28c3/bin-2019/uautomizer/data/4b0c1b3c4/6b455412c6c246a7bf67038ed9a28cf8/FLAG48f4e61d2 [2018-11-22 21:24:10,178 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:24:10,178 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8ba1320d-89f4-4cad-8dc3-8b66d2ed28c3/sv-benchmarks/c/termination-memory-alloca/b.05-alloca_true-termination_true-no-overflow.c.i [2018-11-22 21:24:10,185 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ba1320d-89f4-4cad-8dc3-8b66d2ed28c3/bin-2019/uautomizer/data/4b0c1b3c4/6b455412c6c246a7bf67038ed9a28cf8/FLAG48f4e61d2 [2018-11-22 21:24:10,195 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8ba1320d-89f4-4cad-8dc3-8b66d2ed28c3/bin-2019/uautomizer/data/4b0c1b3c4/6b455412c6c246a7bf67038ed9a28cf8 [2018-11-22 21:24:10,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:24:10,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:24:10,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:24:10,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:24:10,203 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:24:10,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:24:10" (1/1) ... [2018-11-22 21:24:10,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bab14b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:10, skipping insertion in model container [2018-11-22 21:24:10,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:24:10" (1/1) ... [2018-11-22 21:24:10,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:24:10,244 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:24:10,422 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:24:10,430 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:24:10,497 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:24:10,528 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:24:10,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:10 WrapperNode [2018-11-22 21:24:10,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:24:10,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:24:10,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:24:10,529 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:24:10,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:10" (1/1) ... [2018-11-22 21:24:10,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:10" (1/1) ... [2018-11-22 21:24:10,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:24:10,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:24:10,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:24:10,557 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:24:10,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:10" (1/1) ... [2018-11-22 21:24:10,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:10" (1/1) ... [2018-11-22 21:24:10,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:10" (1/1) ... [2018-11-22 21:24:10,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:10" (1/1) ... [2018-11-22 21:24:10,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:10" (1/1) ... [2018-11-22 21:24:10,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:10" (1/1) ... [2018-11-22 21:24:10,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:10" (1/1) ... [2018-11-22 21:24:10,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:24:10,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:24:10,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:24:10,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:24:10,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ba1320d-89f4-4cad-8dc3-8b66d2ed28c3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:24:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:24:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:24:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 21:24:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:24:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:24:10,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:24:10,770 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:24:10,771 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-22 21:24:10,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:24:10 BoogieIcfgContainer [2018-11-22 21:24:10,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:24:10,772 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 21:24:10,772 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 21:24:10,774 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 21:24:10,775 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:24:10,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 09:24:10" (1/3) ... [2018-11-22 21:24:10,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56993f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:24:10, skipping insertion in model container [2018-11-22 21:24:10,776 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:24:10,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:10" (2/3) ... [2018-11-22 21:24:10,777 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56993f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:24:10, skipping insertion in model container [2018-11-22 21:24:10,777 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:24:10,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:24:10" (3/3) ... [2018-11-22 21:24:10,778 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.05-alloca_true-termination_true-no-overflow.c.i [2018-11-22 21:24:10,814 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:24:10,815 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 21:24:10,815 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 21:24:10,815 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 21:24:10,815 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:24:10,815 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:24:10,815 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 21:24:10,815 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:24:10,815 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 21:24:10,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-22 21:24:10,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 21:24:10,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:24:10,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:24:10,843 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 21:24:10,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:24:10,844 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 21:24:10,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-22 21:24:10,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 21:24:10,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:24:10,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:24:10,845 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 21:24:10,845 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:24:10,850 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;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~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 6#L554-11true [2018-11-22 21:24:10,850 INFO L796 eck$LassoCheckResult]: Loop: 6#L554-11true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 8#L554-1true assume test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 >= 0; 12#L554-3true test_fun_#t~short9 := test_fun_#t~short7; 14#L554-4true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3#L554-6true test_fun_#t~short11 := test_fun_#t~short9; 4#L554-7true assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 5#L554-9true assume !!test_fun_#t~short11;havoc test_fun_#t~mem6;havoc test_fun_#t~short11;havoc test_fun_#t~short7;havoc test_fun_#t~short9;havoc test_fun_#t~mem5;havoc test_fun_#t~mem10;havoc test_fun_#t~mem8;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 6#L554-11true [2018-11-22 21:24:10,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:24:10,854 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-22 21:24:10,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:24:10,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:24:10,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:24:10,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:24:10,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:24:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:24:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:24:10,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:24:10,949 INFO L82 PathProgramCache]: Analyzing trace with hash -334850282, now seen corresponding path program 1 times [2018-11-22 21:24:10,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:24:10,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:24:10,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:24:10,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:24:10,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:24:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:24:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:24:10,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:24:10,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1211446548, now seen corresponding path program 1 times [2018-11-22 21:24:10,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:24:10,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:24:10,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:24:10,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:24:10,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:24:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:24:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:24:11,259 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2018-11-22 21:24:11,449 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-11-22 21:24:11,502 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:24:11,503 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:24:11,503 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:24:11,503 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:24:11,503 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:24:11,504 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:24:11,504 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:24:11,504 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:24:11,504 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.05-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-22 21:24:11,504 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:24:11,505 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:24:11,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:11,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:24:12,002 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:24:12,005 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:24:12,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:24:12,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:24:12,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:24:12,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:24:12,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:24:12,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:24:12,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:24:12,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:24:12,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:24:12,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:24:12,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:24:12,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:24:12,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:24:12,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:24:12,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:24:12,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:24:12,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:24:12,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:24:12,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:24:12,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:24:12,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:24:12,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:24:12,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:24:12,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:24:12,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:24:12,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:24:12,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:24:12,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:24:12,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:24:12,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:24:12,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:24:12,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:24:12,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:24:12,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:24:12,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:24:12,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:24:12,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:24:12,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:24:12,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:24:12,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,076 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:24:12,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,078 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:24:12,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:24:12,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:24:12,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:24:12,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:24:12,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:24:12,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,094 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:24:12,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,095 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:24:12,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:24:12,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:24:12,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:24:12,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:24:12,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:24:12,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:24:12,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:24:12,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:24:12,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:24:12,123 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:24:12,138 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 21:24:12,139 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 21:24:12,141 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:24:12,142 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:24:12,143 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:24:12,143 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-22 21:24:12,195 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2018-11-22 21:24:12,201 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:24:12,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:24:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:24:12,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:24:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:24:12,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:24:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:24:12,324 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-22 21:24:12,325 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 4 states. [2018-11-22 21:24:12,400 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 4 states. Result 42 states and 57 transitions. Complement of second has 10 states. [2018-11-22 21:24:12,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-22 21:24:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 21:24:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2018-11-22 21:24:12,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-22 21:24:12,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:24:12,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-22 21:24:12,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:24:12,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-22 21:24:12,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:24:12,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 57 transitions. [2018-11-22 21:24:12,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 21:24:12,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 24 states and 33 transitions. [2018-11-22 21:24:12,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-22 21:24:12,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 21:24:12,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2018-11-22 21:24:12,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:24:12,411 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-22 21:24:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2018-11-22 21:24:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-22 21:24:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-22 21:24:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2018-11-22 21:24:12,431 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-11-22 21:24:12,431 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-11-22 21:24:12,431 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 21:24:12,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2018-11-22 21:24:12,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 21:24:12,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:24:12,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:24:12,432 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 21:24:12,432 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:24:12,433 INFO L794 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;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~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 169#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 170#L554-1 [2018-11-22 21:24:12,433 INFO L796 eck$LassoCheckResult]: Loop: 170#L554-1 assume !test_fun_#t~short7; 171#L554-3 test_fun_#t~short9 := test_fun_#t~short7; 178#L554-4 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 164#L554-6 test_fun_#t~short11 := test_fun_#t~short9; 165#L554-7 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 176#L554-9 assume !!test_fun_#t~short11;havoc test_fun_#t~mem6;havoc test_fun_#t~short11;havoc test_fun_#t~short7;havoc test_fun_#t~short9;havoc test_fun_#t~mem5;havoc test_fun_#t~mem10;havoc test_fun_#t~mem8;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 180#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 170#L554-1 [2018-11-22 21:24:12,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:24:12,433 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-22 21:24:12,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:24:12,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:24:12,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:24:12,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:24:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:24:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:24:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:24:12,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:24:12,449 INFO L82 PathProgramCache]: Analyzing trace with hash -74889736, now seen corresponding path program 1 times [2018-11-22 21:24:12,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:24:12,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:24:12,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:24:12,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:24:12,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:24:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:24:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:24:12,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:24:12,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:24:12,485 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 21:24:12,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:24:12,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:24:12,488 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-22 21:24:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:24:12,522 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2018-11-22 21:24:12,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:24:12,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2018-11-22 21:24:12,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 21:24:12,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2018-11-22 21:24:12,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-22 21:24:12,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-22 21:24:12,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2018-11-22 21:24:12,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:24:12,526 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-11-22 21:24:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2018-11-22 21:24:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-11-22 21:24:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-22 21:24:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-22 21:24:12,528 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-22 21:24:12,528 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-22 21:24:12,528 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 21:24:12,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-22 21:24:12,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 21:24:12,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:24:12,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:24:12,529 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 21:24:12,529 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:24:12,529 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;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~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 223#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 228#L554-1 [2018-11-22 21:24:12,529 INFO L796 eck$LassoCheckResult]: Loop: 228#L554-1 assume !test_fun_#t~short7; 229#L554-3 test_fun_#t~short9 := test_fun_#t~short7; 236#L554-4 assume !test_fun_#t~short9; 224#L554-6 test_fun_#t~short11 := test_fun_#t~short9; 225#L554-7 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 234#L554-9 assume !!test_fun_#t~short11;havoc test_fun_#t~mem6;havoc test_fun_#t~short11;havoc test_fun_#t~short7;havoc test_fun_#t~short9;havoc test_fun_#t~mem5;havoc test_fun_#t~mem10;havoc test_fun_#t~mem8;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 238#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 228#L554-1 [2018-11-22 21:24:12,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:24:12,549 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-11-22 21:24:12,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:24:12,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:24:12,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:24:12,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:24:12,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:24:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:24:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:24:12,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:24:12,565 INFO L82 PathProgramCache]: Analyzing trace with hash -73042694, now seen corresponding path program 1 times [2018-11-22 21:24:12,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:24:12,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:24:12,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:24:12,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:24:12,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:24:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:24:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:24:12,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:24:12,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:24:12,622 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 21:24:12,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:24:12,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:24:12,622 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-22 21:24:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:24:12,663 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-22 21:24:12,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 21:24:12,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2018-11-22 21:24:12,664 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 21:24:12,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-11-22 21:24:12,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 21:24:12,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 21:24:12,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 21:24:12,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:24:12,665 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:24:12,665 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:24:12,665 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:24:12,665 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 21:24:12,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:24:12,665 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 21:24:12,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 21:24:12,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 09:24:12 BoogieIcfgContainer [2018-11-22 21:24:12,670 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 21:24:12,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:24:12,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:24:12,670 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:24:12,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:24:10" (3/4) ... [2018-11-22 21:24:12,672 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 21:24:12,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:24:12,673 INFO L168 Benchmark]: Toolchain (without parser) took 2474.81 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.9 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -252.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:24:12,673 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:24:12,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:24:12,674 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.46 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:24:12,674 INFO L168 Benchmark]: Boogie Preprocessor took 17.20 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. [2018-11-22 21:24:12,675 INFO L168 Benchmark]: RCFGBuilder took 197.44 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:24:12,675 INFO L168 Benchmark]: BuchiAutomizer took 1897.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -99.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:24:12,675 INFO L168 Benchmark]: Witness Printer took 2.65 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:24:12,677 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.46 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.20 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. * RCFGBuilder took 197.44 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1897.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -99.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.65 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 44 SDslu, 39 SDs, 0 SdLazy, 59 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital219 mio100 ax108 hnf100 lsp87 ukn64 mio100 lsp37 div100 bol100 ite100 ukn100 eq172 hnf89 smp92 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...