./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/insertionsort-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/insertionsort-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 8104a25549f6efe413528ca8cc098e1acad610e4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:33:15,580 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:33:15,582 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:33:15,599 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:33:15,599 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:33:15,600 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:33:15,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:33:15,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:33:15,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:33:15,605 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:33:15,606 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:33:15,606 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:33:15,607 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:33:15,608 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:33:15,609 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:33:15,610 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:33:15,611 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:33:15,614 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:33:15,618 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:33:15,622 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:33:15,624 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:33:15,625 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:33:15,627 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:33:15,628 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:33:15,628 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:33:15,629 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:33:15,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:33:15,631 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:33:15,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:33:15,633 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:33:15,633 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:33:15,634 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:33:15,635 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:33:15,635 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:33:15,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:33:15,636 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:33:15,637 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:33:15,654 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:33:15,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:33:15,655 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:33:15,655 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:33:15,656 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:33:15,656 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:33:15,656 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:33:15,656 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:33:15,656 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:33:15,656 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:33:15,657 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:33:15,657 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:33:15,657 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:33:15,657 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:33:15,657 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:33:15,658 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:33:15,659 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:33:15,659 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:33:15,659 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:33:15,660 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:33:15,660 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:33:15,661 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:33:15,661 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:33:15,661 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:33:15,661 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:33:15,661 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:33:15,662 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:33:15,662 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:33:15,664 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:33:15,664 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 8104a25549f6efe413528ca8cc098e1acad610e4 [2019-01-14 02:33:15,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:33:15,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:33:15,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:33:15,736 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:33:15,737 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:33:15,738 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/insertionsort-alloca_true-termination.c.i [2019-01-14 02:33:15,807 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e98ec4c5/5f85ef0eea56494e8aeb059743780b4e/FLAGcd67c9245 [2019-01-14 02:33:16,248 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:33:16,249 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/insertionsort-alloca_true-termination.c.i [2019-01-14 02:33:16,262 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e98ec4c5/5f85ef0eea56494e8aeb059743780b4e/FLAGcd67c9245 [2019-01-14 02:33:16,577 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e98ec4c5/5f85ef0eea56494e8aeb059743780b4e [2019-01-14 02:33:16,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:33:16,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:33:16,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:33:16,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:33:16,589 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:33:16,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:33:16" (1/1) ... [2019-01-14 02:33:16,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7471e6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:16, skipping insertion in model container [2019-01-14 02:33:16,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:33:16" (1/1) ... [2019-01-14 02:33:16,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:33:16,668 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:33:17,067 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:33:17,083 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:33:17,241 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:33:17,308 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:33:17,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17 WrapperNode [2019-01-14 02:33:17,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:33:17,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:33:17,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:33:17,310 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:33:17,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:33:17,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:33:17,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:33:17,371 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:33:17,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:33:17,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:33:17,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:33:17,418 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:33:17,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:33:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:33:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:33:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:33:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:33:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:33:17,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:33:17,825 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:33:17,826 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:33:17,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:33:17 BoogieIcfgContainer [2019-01-14 02:33:17,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:33:17,828 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:33:17,828 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:33:17,832 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:33:17,833 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:33:17,833 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:33:16" (1/3) ... [2019-01-14 02:33:17,834 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f653d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:33:17, skipping insertion in model container [2019-01-14 02:33:17,835 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:33:17,835 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (2/3) ... [2019-01-14 02:33:17,836 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f653d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:33:17, skipping insertion in model container [2019-01-14 02:33:17,836 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:33:17,837 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:33:17" (3/3) ... [2019-01-14 02:33:17,839 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca_true-termination.c.i [2019-01-14 02:33:17,907 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:33:17,907 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:33:17,907 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:33:17,908 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:33:17,908 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:33:17,908 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:33:17,908 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:33:17,909 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:33:17,909 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:33:17,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:33:17,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:33:17,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:17,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:17,951 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:33:17,951 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:33:17,952 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:33:17,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:33:17,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:33:17,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:17,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:17,954 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:33:17,954 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:33:17,961 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 16#L560true assume !(main_~array_size~0 < 1); 5#L560-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 6#L550-3true [2019-01-14 02:33:17,962 INFO L796 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 8#L553-6true assume !true; 9#L553-7true call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 3#L550-2true insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 6#L550-3true [2019-01-14 02:33:17,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:17,967 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-14 02:33:17,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:17,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:18,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:18,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2019-01-14 02:33:18,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:18,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:18,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:18,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:18,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:33:18,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:33:18,123 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:33:18,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:33:18,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:33:18,139 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-01-14 02:33:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:33:18,147 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-01-14 02:33:18,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:33:18,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-01-14 02:33:18,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:33:18,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2019-01-14 02:33:18,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:33:18,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:33:18,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-14 02:33:18,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:33:18,157 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:33:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-14 02:33:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 02:33:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:33:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-14 02:33:18,187 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:33:18,187 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:33:18,187 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:33:18,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-01-14 02:33:18,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:33:18,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:18,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:18,189 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:33:18,189 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:33:18,189 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 43#L560 assume !(main_~array_size~0 < 1); 44#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 41#L550-3 [2019-01-14 02:33:18,189 INFO L796 eck$LassoCheckResult]: Loop: 41#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 39#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 46#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 47#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 48#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 40#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 41#L550-3 [2019-01-14 02:33:18,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:18,190 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-14 02:33:18,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:18,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:18,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:18,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:18,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:18,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2019-01-14 02:33:18,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:18,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:18,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:18,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:18,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:18,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2019-01-14 02:33:18,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:18,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:18,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:18,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:18,809 WARN L181 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-01-14 02:33:19,014 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-14 02:33:19,185 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-14 02:33:19,201 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:33:19,202 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:33:19,202 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:33:19,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:33:19,202 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:33:19,203 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:33:19,203 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:33:19,203 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:33:19,203 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:33:19,203 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:33:19,204 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:33:19,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,779 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-01-14 02:33:19,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:19,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:20,522 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:33:20,526 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:33:20,528 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 [2019-01-14 02:33:20,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,535 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 [2019-01-14 02:33:20,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,540 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 [2019-01-14 02:33:20,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,545 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 [2019-01-14 02:33:20,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,549 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 [2019-01-14 02:33:20,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,558 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 [2019-01-14 02:33:20,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,564 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 [2019-01-14 02:33:20,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,575 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 [2019-01-14 02:33:20,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,584 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 [2019-01-14 02:33:20,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,590 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 [2019-01-14 02:33:20,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,599 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 [2019-01-14 02:33:20,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,607 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 [2019-01-14 02:33:20,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,627 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 [2019-01-14 02:33:20,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,628 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:33:20,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,634 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:33:20,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,654 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 [2019-01-14 02:33:20,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,662 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 [2019-01-14 02:33:20,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:20,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:20,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:20,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:20,665 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 [2019-01-14 02:33:20,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:20,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:20,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:20,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:20,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:20,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:20,749 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:33:20,794 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:33:20,795 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-14 02:33:20,799 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:33:20,801 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:33:20,804 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:33:20,805 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_~i~0) = 1*ULTIMATE.start_insertionSort_~array_size - 1*ULTIMATE.start_insertionSort_~i~0 Supporting invariants [] [2019-01-14 02:33:20,891 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 02:33:20,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:20,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:20,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:21,003 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:33:21,004 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 02:33:21,039 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2019-01-14 02:33:21,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:33:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:33:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-01-14 02:33:21,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 02:33:21,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:21,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-14 02:33:21,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:21,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-14 02:33:21,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:21,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2019-01-14 02:33:21,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:33:21,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 23 transitions. [2019-01-14 02:33:21,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:33:21,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:33:21,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-01-14 02:33:21,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:33:21,049 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 02:33:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-01-14 02:33:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-14 02:33:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:33:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-01-14 02:33:21,051 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-14 02:33:21,052 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-14 02:33:21,052 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:33:21,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-01-14 02:33:21,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:33:21,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:21,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:21,053 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:33:21,053 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:33:21,054 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 141#L560 assume !(main_~array_size~0 < 1); 142#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 143#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 135#L553-6 [2019-01-14 02:33:21,054 INFO L796 eck$LassoCheckResult]: Loop: 135#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 144#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 147#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 134#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 135#L553-6 [2019-01-14 02:33:21,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:21,054 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-14 02:33:21,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:21,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:21,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:21,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:21,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:21,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 1 times [2019-01-14 02:33:21,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:21,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:21,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:21,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:21,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:21,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:21,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1185710257, now seen corresponding path program 1 times [2019-01-14 02:33:21,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:21,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:21,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:21,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:21,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:21,254 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 02:33:21,585 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-01-14 02:33:21,655 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:33:21,655 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:33:21,656 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:33:21,656 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:33:21,656 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:33:21,656 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:33:21,656 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:33:21,656 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:33:21,656 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:33:21,657 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:33:21,657 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:33:21,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,844 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-01-14 02:33:21,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:22,520 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:33:22,520 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:33:22,520 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 [2019-01-14 02:33:22,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:22,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:22,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:22,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:22,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:22,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:22,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:22,536 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 [2019-01-14 02:33:22,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:22,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:22,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:22,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:22,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:22,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:22,568 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:33:22,591 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:33:22,592 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:33:22,592 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:33:22,593 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:33:22,593 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:33:22,593 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2019-01-14 02:33:22,681 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 02:33:22,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:22,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:22,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:23,056 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 [2019-01-14 02:33:23,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 02:33:23,105 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 47 states and 62 transitions. Complement of second has 9 states. [2019-01-14 02:33:23,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:33:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:33:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-01-14 02:33:23,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:33:23,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:23,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 02:33:23,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:23,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-14 02:33:23,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:23,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2019-01-14 02:33:23,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:33:23,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 30 states and 40 transitions. [2019-01-14 02:33:23,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:33:23,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:33:23,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-14 02:33:23,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:33:23,114 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-14 02:33:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-14 02:33:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-01-14 02:33:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 02:33:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-01-14 02:33:23,118 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-01-14 02:33:23,118 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-01-14 02:33:23,119 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:33:23,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2019-01-14 02:33:23,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:33:23,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:23,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:23,120 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:33:23,120 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:33:23,121 INFO L794 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 274#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 275#L560 assume !(main_~array_size~0 < 1); 276#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 277#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 271#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 283#L553-1 assume !insertionSort_#t~short6; 284#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 285#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 272#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 273#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 269#L553-6 [2019-01-14 02:33:23,121 INFO L796 eck$LassoCheckResult]: Loop: 269#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 278#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 282#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 268#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 269#L553-6 [2019-01-14 02:33:23,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:23,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2019-01-14 02:33:23,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:23,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:23,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:23,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:23,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:23,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:33:23,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:33:23,221 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:33:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:23,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2019-01-14 02:33:23,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:23,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:23,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:23,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:23,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:23,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:33:23,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:33:23,342 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-14 02:33:23,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:33:23,499 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-01-14 02:33:23,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:33:23,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-01-14 02:33:23,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:33:23,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2019-01-14 02:33:23,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:33:23,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:33:23,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2019-01-14 02:33:23,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:33:23,504 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-14 02:33:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2019-01-14 02:33:23,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2019-01-14 02:33:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 02:33:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-01-14 02:33:23,507 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-14 02:33:23,507 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-14 02:33:23,507 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:33:23,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-01-14 02:33:23,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:33:23,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:23,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:23,510 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:33:23,510 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:33:23,510 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 341#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 342#L560 assume !(main_~array_size~0 < 1); 343#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 344#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 346#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 347#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 352#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 353#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 339#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 340#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 336#L553-6 [2019-01-14 02:33:23,510 INFO L796 eck$LassoCheckResult]: Loop: 336#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 345#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 351#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 335#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 336#L553-6 [2019-01-14 02:33:23,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:23,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1301169056, now seen corresponding path program 2 times [2019-01-14 02:33:23,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:23,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:23,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:23,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:23,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:23,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:23,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 3 times [2019-01-14 02:33:23,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:23,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:23,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:23,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:23,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:23,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:23,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1886560891, now seen corresponding path program 1 times [2019-01-14 02:33:23,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:23,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:23,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:23,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:23,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:23,804 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 02:33:24,327 WARN L181 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2019-01-14 02:33:24,466 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:33:24,466 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:33:24,466 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:33:24,466 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:33:24,466 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:33:24,467 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:33:24,467 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:33:24,467 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:33:24,467 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:33:24,467 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:33:24,467 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:33:24,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:24,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:24,697 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-01-14 02:33:24,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:24,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:24,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:24,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:24,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:24,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:24,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:24,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:24,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:24,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:24,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:24,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:25,353 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:33:25,353 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:33:25,353 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 [2019-01-14 02:33:25,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:25,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:25,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:25,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:25,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:25,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:25,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:25,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:25,359 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 [2019-01-14 02:33:25,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:25,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:25,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:25,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:25,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:25,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:25,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:25,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:25,361 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 [2019-01-14 02:33:25,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:25,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:25,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:25,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:25,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:25,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:25,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:25,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:25,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:25,369 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:33:25,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:25,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:25,372 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:33:25,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:25,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:25,379 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 [2019-01-14 02:33:25,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:25,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:25,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:25,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:25,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:25,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:25,399 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:33:25,417 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:33:25,417 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 02:33:25,417 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:33:25,418 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:33:25,419 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:33:25,420 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2019-01-14 02:33:25,507 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-01-14 02:33:25,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:25,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:25,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:25,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:25,578 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 [2019-01-14 02:33:25,578 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-01-14 02:33:25,623 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2019-01-14 02:33:25,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:33:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:33:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-01-14 02:33:25,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-14 02:33:25,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:25,626 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:33:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:25,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:25,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:25,866 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:33:25,866 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-01-14 02:33:25,914 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2019-01-14 02:33:25,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:33:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:33:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-01-14 02:33:25,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-14 02:33:25,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:25,917 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:33:25,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:25,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:25,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:25,982 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:33:25,982 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-01-14 02:33:26,055 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 56 states and 75 transitions. Complement of second has 8 states. [2019-01-14 02:33:26,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:33:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:33:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-01-14 02:33:26,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-14 02:33:26,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:26,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-14 02:33:26,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:26,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 8 letters. [2019-01-14 02:33:26,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:26,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 75 transitions. [2019-01-14 02:33:26,062 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:33:26,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 0 states and 0 transitions. [2019-01-14 02:33:26,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:33:26,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:33:26,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:33:26,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:33:26,063 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:33:26,063 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:33:26,063 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:33:26,063 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:33:26,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:33:26,063 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:33:26,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:33:26,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:33:26 BoogieIcfgContainer [2019-01-14 02:33:26,074 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:33:26,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:33:26,074 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:33:26,075 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:33:26,075 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:33:17" (3/4) ... [2019-01-14 02:33:26,080 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:33:26,081 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:33:26,081 INFO L168 Benchmark]: Toolchain (without parser) took 9501.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 952.7 MB in the beginning and 829.8 MB in the end (delta: 123.0 MB). Peak memory consumption was 323.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:33:26,083 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:33:26,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -136.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:33:26,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:33:26,086 INFO L168 Benchmark]: Boogie Preprocessor took 47.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:33:26,087 INFO L168 Benchmark]: RCFGBuilder took 409.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:33:26,087 INFO L168 Benchmark]: BuchiAutomizer took 8246.06 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 829.8 MB in the end (delta: 234.5 MB). Peak memory consumption was 329.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:33:26,090 INFO L168 Benchmark]: Witness Printer took 6.25 ms. Allocated memory is still 1.2 GB. Free memory is still 829.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:33:26,095 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 726.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -136.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 409.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8246.06 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 829.8 MB in the end (delta: 234.5 MB). Peak memory consumption was 329.4 MB. Max. memory is 11.5 GB. * Witness Printer took 6.25 ms. Allocated memory is still 1.2 GB. Free memory is still 829.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function j and consists of 5 locations. One nondeterministic module has affine ranking function j and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.7s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 82 SDtfs, 116 SDslu, 43 SDs, 0 SdLazy, 130 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital166 mio100 ax110 hnf99 lsp86 ukn75 mio100 lsp63 div100 bol100 ite100 ukn100 eq179 hnf84 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 5 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...