./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.07-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1c4b1ebc-9574-4cc3-b385-ee928feb1bb2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1c4b1ebc-9574-4cc3-b385-ee928feb1bb2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1c4b1ebc-9574-4cc3-b385-ee928feb1bb2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1c4b1ebc-9574-4cc3-b385-ee928feb1bb2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.07-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1c4b1ebc-9574-4cc3-b385-ee928feb1bb2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1c4b1ebc-9574-4cc3-b385-ee928feb1bb2/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 5b7c2858314131c244395f9ab37913061eb343a6 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:37:45,468 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:37:45,469 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:37:45,477 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:37:45,477 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:37:45,478 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:37:45,479 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:37:45,480 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:37:45,481 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:37:45,482 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:37:45,483 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:37:45,483 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:37:45,483 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:37:45,484 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:37:45,485 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:37:45,486 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:37:45,486 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:37:45,487 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:37:45,489 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:37:45,490 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:37:45,491 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:37:45,492 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:37:45,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:37:45,494 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:37:45,494 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:37:45,495 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:37:45,495 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:37:45,496 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:37:45,496 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:37:45,497 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:37:45,497 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:37:45,498 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:37:45,498 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:37:45,498 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:37:45,499 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:37:45,499 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:37:45,500 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1c4b1ebc-9574-4cc3-b385-ee928feb1bb2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 04:37:45,511 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:37:45,511 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:37:45,512 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:37:45,512 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:37:45,513 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:37:45,513 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:37:45,513 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:37:45,513 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:37:45,513 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:37:45,513 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:37:45,514 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:37:45,514 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:37:45,514 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:37:45,514 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:37:45,514 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:37:45,514 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:37:45,514 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:37:45,515 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:37:45,515 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:37:45,515 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:37:45,515 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:37:45,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:37:45,515 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:37:45,515 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:37:45,516 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:37:45,516 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:37:45,516 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:37:45,517 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:37:45,517 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_1c4b1ebc-9574-4cc3-b385-ee928feb1bb2/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 -> 5b7c2858314131c244395f9ab37913061eb343a6 [2018-11-10 04:37:45,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:37:45,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:37:45,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:37:45,555 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:37:45,556 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:37:45,556 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1c4b1ebc-9574-4cc3-b385-ee928feb1bb2/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.07-alloca_true-termination_true-no-overflow.c.i [2018-11-10 04:37:45,596 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1c4b1ebc-9574-4cc3-b385-ee928feb1bb2/bin-2019/uautomizer/data/c114e1c14/7dc52dad927744fa9e2f954126ab7e23/FLAG4621324c3 [2018-11-10 04:37:45,956 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:37:45,956 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1c4b1ebc-9574-4cc3-b385-ee928feb1bb2/sv-benchmarks/c/termination-memory-alloca/a.07-alloca_true-termination_true-no-overflow.c.i [2018-11-10 04:37:45,963 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1c4b1ebc-9574-4cc3-b385-ee928feb1bb2/bin-2019/uautomizer/data/c114e1c14/7dc52dad927744fa9e2f954126ab7e23/FLAG4621324c3 [2018-11-10 04:37:45,974 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1c4b1ebc-9574-4cc3-b385-ee928feb1bb2/bin-2019/uautomizer/data/c114e1c14/7dc52dad927744fa9e2f954126ab7e23 [2018-11-10 04:37:45,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:37:45,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:37:45,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:37:45,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:37:45,980 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:37:45,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:37:45" (1/1) ... [2018-11-10 04:37:45,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c55556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:45, skipping insertion in model container [2018-11-10 04:37:45,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:37:45" (1/1) ... [2018-11-10 04:37:45,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:37:46,020 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:37:46,198 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:37:46,207 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:37:46,234 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:37:46,263 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:37:46,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:46 WrapperNode [2018-11-10 04:37:46,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:37:46,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:37:46,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:37:46,264 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:37:46,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:46" (1/1) ... [2018-11-10 04:37:46,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:46" (1/1) ... [2018-11-10 04:37:46,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:37:46,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:37:46,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:37:46,353 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:37:46,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:46" (1/1) ... [2018-11-10 04:37:46,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:46" (1/1) ... [2018-11-10 04:37:46,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:46" (1/1) ... [2018-11-10 04:37:46,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:46" (1/1) ... [2018-11-10 04:37:46,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:46" (1/1) ... [2018-11-10 04:37:46,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:46" (1/1) ... [2018-11-10 04:37:46,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:46" (1/1) ... [2018-11-10 04:37:46,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:37:46,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:37:46,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:37:46,378 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:37:46,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1c4b1ebc-9574-4cc3-b385-ee928feb1bb2/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-10 04:37:46,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:37:46,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:37:46,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:37:46,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:37:46,659 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:37:46,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:37:46 BoogieIcfgContainer [2018-11-10 04:37:46,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:37:46,660 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:37:46,660 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:37:46,662 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:37:46,662 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:37:46,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:37:45" (1/3) ... [2018-11-10 04:37:46,663 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73fb1de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:37:46, skipping insertion in model container [2018-11-10 04:37:46,663 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:37:46,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:46" (2/3) ... [2018-11-10 04:37:46,664 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73fb1de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:37:46, skipping insertion in model container [2018-11-10 04:37:46,664 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:37:46,664 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:37:46" (3/3) ... [2018-11-10 04:37:46,665 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.07-alloca_true-termination_true-no-overflow.c.i [2018-11-10 04:37:46,702 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:37:46,702 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:37:46,702 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:37:46,702 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:37:46,703 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:37:46,703 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:37:46,703 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:37:46,703 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:37:46,703 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:37:46,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-10 04:37:46,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:37:46,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:46,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:46,734 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:37:46,734 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:37:46,735 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:37:46,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-10 04:37:46,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:37:46,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:46,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:46,737 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:37:46,738 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:37:46,745 INFO L793 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet14, 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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 23#L553true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 26#L553-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 21#L554true SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 7#L555true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 17#L557-10true [2018-11-10 04:37:46,746 INFO L795 eck$LassoCheckResult]: Loop: 17#L557-10true assume true; 4#L557true SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6#L557-1true SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 8#L557-2true test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 9#L557-3true assume !test_fun_#t~short10; 29#L557-8true assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9; 16#L558true SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 18#L558-1true SUMMARY for call write~int(test_fun_#t~mem11 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 20#L558-2true havoc test_fun_#t~mem11; 15#L559true SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L559 3#L559-1true SUMMARY for call write~int(test_fun_#t~mem12 + 1, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L559-1 5#L559-2true havoc test_fun_#t~mem12; 17#L557-10true [2018-11-10 04:37:46,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:46,751 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 1 times [2018-11-10 04:37:46,752 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:46,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:46,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:46,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:46,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:46,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:46,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1554062579, now seen corresponding path program 1 times [2018-11-10 04:37:46,875 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:46,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:46,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:46,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:46,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:46,908 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-10 04:37:46,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:37:46,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:37:46,912 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:37:46,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:37:46,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:37:46,923 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2018-11-10 04:37:46,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:37:46,951 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-10 04:37:46,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:37:46,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2018-11-10 04:37:46,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:37:46,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 21 transitions. [2018-11-10 04:37:46,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 04:37:46,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 04:37:46,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 21 transitions. [2018-11-10 04:37:46,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:37:46,958 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-10 04:37:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 21 transitions. [2018-11-10 04:37:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 04:37:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 04:37:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-10 04:37:46,977 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-10 04:37:46,977 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-10 04:37:46,977 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:37:46,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 21 transitions. [2018-11-10 04:37:46,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:37:46,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:46,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:46,979 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:37:46,979 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:37:46,979 INFO L793 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 78#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet14, 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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 79#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 80#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 76#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 74#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 68#L557-10 [2018-11-10 04:37:46,979 INFO L795 eck$LassoCheckResult]: Loop: 68#L557-10 assume true; 69#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 70#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 72#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 75#L557-3 assume test_fun_#t~short10; 77#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-4 81#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-5 83#L557-6 test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 84#L557-8 assume !!test_fun_#t~short10;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9; 64#L558 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 65#L558-1 SUMMARY for call write~int(test_fun_#t~mem11 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 71#L558-2 havoc test_fun_#t~mem11; 73#L559 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L559 66#L559-1 SUMMARY for call write~int(test_fun_#t~mem12 + 1, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L559-1 67#L559-2 havoc test_fun_#t~mem12; 68#L557-10 [2018-11-10 04:37:46,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 2 times [2018-11-10 04:37:46,979 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:46,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:46,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:46,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:46,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:47,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1370635495, now seen corresponding path program 1 times [2018-11-10 04:37:47,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:47,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:47,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:47,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:47,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:47,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:47,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2055766933, now seen corresponding path program 1 times [2018-11-10 04:37:47,040 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:47,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:47,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:47,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:47,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:47,247 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2018-11-10 04:37:47,610 WARN L179 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 118 [2018-11-10 04:37:47,779 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-10 04:37:47,787 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:37:47,788 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:37:47,788 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:37:47,789 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:37:47,789 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:37:47,789 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:37:47,789 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:37:47,789 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:37:47,789 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.07-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 04:37:47,789 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:37:47,790 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:37:47,809 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-10 04:37:47,813 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-10 04:37:47,815 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-10 04:37:47,817 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-10 04:37:47,819 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-10 04:37:47,821 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-10 04:37:47,823 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-10 04:37:47,825 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-10 04:37:47,827 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-10 04:37:47,830 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-10 04:37:48,354 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 127 [2018-11-10 04:37:48,458 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-10 04:37:48,459 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-10 04:37:48,460 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-10 04:37:48,462 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-10 04:37:48,463 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-10 04:37:48,464 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-10 04:37:48,465 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-10 04:37:48,467 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-10 04:37:48,681 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-11-10 04:37:48,947 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:37:48,951 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:37:48,953 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-10 04:37:48,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:48,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:48,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:48,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:48,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:48,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:48,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:48,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:48,959 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-10 04:37:48,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:48,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:48,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:48,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:48,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:48,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:48,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:48,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:48,962 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-10 04:37:48,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:48,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:48,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:48,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:48,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:48,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:48,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:48,970 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-10 04:37:48,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:48,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:48,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:48,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:48,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:48,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:48,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:48,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:48,973 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-10 04:37:48,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:48,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:48,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:48,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:48,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:48,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:48,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:48,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:48,975 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-10 04:37:48,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:48,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:48,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:48,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:48,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:48,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:48,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:48,977 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:48,977 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-10 04:37:48,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:48,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:48,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:48,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:48,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:48,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:48,984 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:48,984 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-10 04:37:48,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:48,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:48,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:48,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:48,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:48,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:48,992 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:48,993 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-10 04:37:48,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:48,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:48,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:48,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:48,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:48,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:48,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:48,997 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-10 04:37:48,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:48,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:48,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:48,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:48,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:48,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:49,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:49,003 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-10 04:37:49,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:49,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:49,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:49,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:49,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:49,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:49,038 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:37:49,061 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:37:49,061 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 04:37:49,063 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:37:49,064 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:37:49,064 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:37:49,065 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1, 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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_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-10 04:37:49,189 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-10 04:37:49,193 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 04:37:49,194 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 04:37:49,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:49,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:49,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:49,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:49,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 85 [2018-11-10 04:37:49,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:49,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:49,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 73 [2018-11-10 04:37:49,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:37:49,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:49,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2018-11-10 04:37:49,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:37:49,663 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:49,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 72 [2018-11-10 04:37:49,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-11-10 04:37:49,734 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:49,734 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:49,737 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:49,749 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:49,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:49,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 95 [2018-11-10 04:37:49,763 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-10 04:37:49,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 04:37:49,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-10 04:37:49,890 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:60, output treesize:138 [2018-11-10 04:37:49,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:49,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-11-10 04:37:49,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 04:37:49,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:37:49,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:37:50,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:50,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-11-10 04:37:50,015 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:50,015 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:50,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-11-10 04:37:50,017 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:37:50,042 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:50,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-10 04:37:50,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 04:37:50,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:37:50,088 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:37:50,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-11-10 04:37:50,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-10 04:37:50,092 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 04:37:50,097 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:37:50,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 04:37:50,121 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:137, output treesize:99 [2018-11-10 04:37:50,164 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-10 04:37:50,167 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2018-11-10 04:37:50,167 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 21 transitions. cyclomatic complexity: 1 Second operand 15 states. [2018-11-10 04:37:50,476 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 21 transitions. cyclomatic complexity: 1. Second operand 15 states. Result 37 states and 38 transitions. Complement of second has 26 states. [2018-11-10 04:37:50,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-11-10 04:37:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 04:37:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2018-11-10 04:37:50,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 22 transitions. Stem has 6 letters. Loop has 15 letters. [2018-11-10 04:37:50,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:50,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 22 transitions. Stem has 21 letters. Loop has 15 letters. [2018-11-10 04:37:50,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:50,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 22 transitions. Stem has 6 letters. Loop has 30 letters. [2018-11-10 04:37:50,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:50,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 38 transitions. [2018-11-10 04:37:50,482 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:37:50,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-11-10 04:37:50,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:37:50,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:37:50,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:37:50,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:37:50,483 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:37:50,483 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:37:50,483 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:37:50,483 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:37:50,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:37:50,484 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:37:50,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:37:50,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:37:50 BoogieIcfgContainer [2018-11-10 04:37:50,489 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:37:50,489 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:37:50,489 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:37:50,490 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:37:50,490 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:37:46" (3/4) ... [2018-11-10 04:37:50,493 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:37:50,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:37:50,493 INFO L168 Benchmark]: Toolchain (without parser) took 4517.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 301.5 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 131.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:50,494 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:37:50,495 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.46 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 929.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:50,495 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 929.6 MB in the beginning and 1.2 GB in the end (delta: -230.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:50,496 INFO L168 Benchmark]: Boogie Preprocessor took 24.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:37:50,496 INFO L168 Benchmark]: RCFGBuilder took 281.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:50,497 INFO L168 Benchmark]: BuchiAutomizer took 3829.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 149.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:50,497 INFO L168 Benchmark]: Witness Printer took 3.59 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:37:50,500 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.46 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 929.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 929.6 MB in the beginning and 1.2 GB in the end (delta: -230.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 281.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3829.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 149.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.59 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 14 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 26 SDslu, 39 SDs, 0 SdLazy, 72 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital420 mio100 ax104 hnf100 lsp93 ukn69 mio100 lsp37 div100 bol100 ite100 ukn100 eq198 hnf87 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms 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...