./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 91b1670e 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-91b1670 [2018-11-28 23:20:43,067 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:20:43,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:20:43,090 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:20:43,091 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:20:43,092 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:20:43,096 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:20:43,098 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:20:43,100 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:20:43,101 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:20:43,102 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:20:43,102 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:20:43,103 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:20:43,104 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:20:43,106 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:20:43,107 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:20:43,108 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:20:43,110 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:20:43,112 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:20:43,116 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:20:43,117 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:20:43,118 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:20:43,120 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:20:43,121 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:20:43,121 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:20:43,122 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:20:43,123 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:20:43,123 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:20:43,124 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:20:43,125 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:20:43,125 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:20:43,126 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:20:43,126 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:20:43,126 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:20:43,127 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:20:43,128 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:20:43,128 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:20:43,155 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:20:43,157 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:20:43,158 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:20:43,158 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:20:43,158 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:20:43,160 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:20:43,160 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:20:43,161 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:20:43,161 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:20:43,161 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:20:43,161 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:20:43,162 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:20:43,162 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:20:43,162 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:20:43,162 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:20:43,162 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:20:43,163 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:20:43,163 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:20:43,163 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:20:43,163 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:20:43,163 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:20:43,163 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:20:43,164 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:20:43,167 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:20:43,167 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:20:43,167 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:20:43,167 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:20:43,168 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:20:43,169 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:20:43,169 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 [2018-11-28 23:20:43,227 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:20:43,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:20:43,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:20:43,255 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:20:43,255 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:20:43,256 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/insertionsort-alloca_true-termination.c.i [2018-11-28 23:20:43,322 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff2ed658/99559def2f534c7a8e1940b51efd03bb/FLAGdbdf39695 [2018-11-28 23:20:43,850 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:20:43,851 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/insertionsort-alloca_true-termination.c.i [2018-11-28 23:20:43,872 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff2ed658/99559def2f534c7a8e1940b51efd03bb/FLAGdbdf39695 [2018-11-28 23:20:44,169 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ff2ed658/99559def2f534c7a8e1940b51efd03bb [2018-11-28 23:20:44,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:20:44,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:20:44,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:20:44,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:20:44,182 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:20:44,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:20:44" (1/1) ... [2018-11-28 23:20:44,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0c44a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:44, skipping insertion in model container [2018-11-28 23:20:44,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:20:44" (1/1) ... [2018-11-28 23:20:44,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:20:44,250 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:20:44,615 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:20:44,628 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:20:44,783 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:20:44,836 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:20:44,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:44 WrapperNode [2018-11-28 23:20:44,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:20:44,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:20:44,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:20:44,838 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:20:44,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:44" (1/1) ... [2018-11-28 23:20:44,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:44" (1/1) ... [2018-11-28 23:20:44,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:20:44,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:20:44,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:20:44,903 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:20:44,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:44" (1/1) ... [2018-11-28 23:20:44,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:44" (1/1) ... [2018-11-28 23:20:44,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:44" (1/1) ... [2018-11-28 23:20:44,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:44" (1/1) ... [2018-11-28 23:20:44,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:44" (1/1) ... [2018-11-28 23:20:44,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:44" (1/1) ... [2018-11-28 23:20:44,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:44" (1/1) ... [2018-11-28 23:20:44,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:20:44,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:20:44,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:20:44,950 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:20:44,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:44" (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 [2018-11-28 23:20:45,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:20:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:20:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:20:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:20:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:20:45,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:20:45,553 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:20:45,553 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:20:45,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:45 BoogieIcfgContainer [2018-11-28 23:20:45,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:20:45,554 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:20:45,555 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:20:45,559 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:20:45,560 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:20:45,560 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:20:44" (1/3) ... [2018-11-28 23:20:45,562 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9c24601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:20:45, skipping insertion in model container [2018-11-28 23:20:45,562 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:20:45,562 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:44" (2/3) ... [2018-11-28 23:20:45,562 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9c24601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:20:45, skipping insertion in model container [2018-11-28 23:20:45,563 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:20:45,563 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:45" (3/3) ... [2018-11-28 23:20:45,565 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca_true-termination.c.i [2018-11-28 23:20:45,628 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:20:45,629 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:20:45,629 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:20:45,629 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:20:45,629 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:20:45,629 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:20:45,630 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:20:45,630 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:20:45,630 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:20:45,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:20:45,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:20:45,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:45,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:45,694 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:20:45,694 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:20:45,694 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:20:45,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:20:45,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:20:45,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:45,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:45,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:20:45,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:20:45,708 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.alloc(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 [2018-11-28 23:20:45,709 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 [2018-11-28 23:20:45,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:45,717 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-28 23:20:45,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:45,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:45,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:45,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:45,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:45,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:45,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2018-11-28 23:20:45,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:45,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:45,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:45,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:45,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:45,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:20:45,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:20:45,957 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:20:45,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:20:45,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:20:45,980 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-28 23:20:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:45,988 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-28 23:20:45,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:20:45,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-28 23:20:45,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:20:45,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2018-11-28 23:20:45,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:20:45,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:20:45,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-28 23:20:45,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:20:45,998 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 23:20:46,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-28 23:20:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-28 23:20:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:20:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-28 23:20:46,030 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 23:20:46,030 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 23:20:46,030 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:20:46,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-28 23:20:46,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:20:46,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:46,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:46,032 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:20:46,032 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:20:46,032 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.alloc(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 [2018-11-28 23:20:46,032 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~short6;havoc insertionSort_#t~mem5; 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 [2018-11-28 23:20:46,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:46,033 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-28 23:20:46,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:46,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:46,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:46,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:46,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:46,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:46,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2018-11-28 23:20:46,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:46,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:46,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:46,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:46,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:46,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2018-11-28 23:20:46,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:46,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:46,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:46,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:46,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:46,666 WARN L180 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2018-11-28 23:20:47,044 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 23:20:47,055 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:47,056 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:47,057 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:47,057 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:47,057 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:47,057 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:47,057 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:47,057 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:47,058 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:20:47,058 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:47,059 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:47,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:47,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:47,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:47,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:47,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:47,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:47,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:47,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:47,696 WARN L180 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-11-28 23:20:47,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:47,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:47,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:47,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:47,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:47,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:48,391 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:48,396 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:48,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:48,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:48,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:48,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:48,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:48,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:48,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:48,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:48,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:48,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:48,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:48,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:48,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:48,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:48,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:48,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:48,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:48,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:48,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:48,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:48,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:48,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:48,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:48,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:48,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:48,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:48,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:48,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:48,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:48,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:48,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:48,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:48,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:48,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:48,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:48,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:48,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:48,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:48,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:48,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:48,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:48,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:48,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:48,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:48,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:48,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:48,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:48,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:48,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:48,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:48,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:48,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:48,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:48,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:48,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:48,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:48,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:48,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:48,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:48,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:48,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:48,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:48,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:48,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:48,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:48,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:48,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:48,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:48,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:48,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:48,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:48,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:48,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:48,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:48,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:48,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:48,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:48,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:48,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:48,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:48,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:48,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:48,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:48,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:48,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:48,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:48,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:48,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:48,493 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:48,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:48,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:48,498 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:48,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:48,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:48,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:48,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:48,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:48,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:48,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:48,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:48,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:48,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:48,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:48,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:48,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:48,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:48,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:48,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:48,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:48,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:48,650 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:48,727 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 23:20:48,728 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:20:48,730 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:48,732 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:20:48,732 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:48,733 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 [] [2018-11-28 23:20:48,834 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:20:48,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:48,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:48,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:49,021 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 [2018-11-28 23:20:49,022 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-28 23:20:49,085 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. [2018-11-28 23:20:49,086 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 [2018-11-28 23:20:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:20:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-28 23:20:49,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 23:20:49,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:49,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:20:49,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:49,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-28 23:20:49,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:49,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2018-11-28 23:20:49,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:20:49,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 23 transitions. [2018-11-28 23:20:49,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:20:49,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:20:49,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-11-28 23:20:49,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:49,094 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-28 23:20:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-11-28 23:20:49,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-28 23:20:49,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:20:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-11-28 23:20:49,097 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 23:20:49,097 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 23:20:49,097 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:20:49,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-11-28 23:20:49,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:20:49,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:49,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:49,099 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:20:49,099 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:20:49,099 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.alloc(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 [2018-11-28 23:20:49,099 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~short6;havoc insertionSort_#t~mem5;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 [2018-11-28 23:20:49,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:49,100 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-28 23:20:49,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:49,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:49,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:49,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:49,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:49,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:49,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 1 times [2018-11-28 23:20:49,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:49,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:49,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:49,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:49,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:49,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:49,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1185710257, now seen corresponding path program 1 times [2018-11-28 23:20:49,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:49,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:49,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:49,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:49,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:49,336 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-28 23:20:49,679 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2018-11-28 23:20:49,735 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:49,735 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:49,736 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:49,736 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:49,736 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:49,736 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:49,737 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:49,737 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:49,737 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:20:49,737 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:49,737 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:49,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:49,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:49,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:49,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:49,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:49,939 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-11-28 23:20:49,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:50,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:50,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:50,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:50,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:50,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:50,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:50,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:50,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:50,482 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:20:50,637 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:50,637 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:50,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:50,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:50,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:50,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:50,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:50,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:50,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:50,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:50,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:50,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:50,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:50,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:50,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:50,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:50,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:50,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:50,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:50,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:50,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:50,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:50,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:50,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:50,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:50,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:50,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:50,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:50,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:50,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:50,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:50,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:50,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:50,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:50,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:50,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:50,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:50,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:50,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:50,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:50,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:50,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:50,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:50,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:50,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:50,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:50,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:50,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:50,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:50,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:50,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:50,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:50,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:50,756 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:50,784 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:20:50,785 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 23:20:50,785 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:50,786 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:20:50,790 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:50,791 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2018-11-28 23:20:50,866 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:20:50,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:50,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:50,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:51,180 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:20:51,180 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 23:20:51,238 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. [2018-11-28 23:20:51,240 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 [2018-11-28 23:20:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:20:51,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-28 23:20:51,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:20:51,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:51,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 23:20:51,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:51,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-28 23:20:51,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:51,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2018-11-28 23:20:51,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:20:51,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 30 states and 40 transitions. [2018-11-28 23:20:51,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:20:51,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:20:51,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-28 23:20:51,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:51,247 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-28 23:20:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-28 23:20:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2018-11-28 23:20:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:20:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-11-28 23:20:51,251 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-28 23:20:51,251 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-28 23:20:51,251 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:20:51,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2018-11-28 23:20:51,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:20:51,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:51,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:51,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:20:51,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:20:51,253 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.alloc(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~short6;havoc insertionSort_#t~mem5; 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 [2018-11-28 23:20:51,254 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~short6;havoc insertionSort_#t~mem5;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 [2018-11-28 23:20:51,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:51,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2018-11-28 23:20:51,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:51,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:51,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:51,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:51,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:51,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:20:51,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:20:51,605 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:20:51,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:51,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2018-11-28 23:20:51,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:51,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:51,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:51,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:51,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:52,098 WARN L180 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-28 23:20:52,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:20:52,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:20:52,134 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-28 23:20:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:52,306 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2018-11-28 23:20:52,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:20:52,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2018-11-28 23:20:52,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:20:52,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2018-11-28 23:20:52,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:20:52,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:20:52,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2018-11-28 23:20:52,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:52,310 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-11-28 23:20:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2018-11-28 23:20:52,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-11-28 23:20:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 23:20:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-11-28 23:20:52,315 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-28 23:20:52,315 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-28 23:20:52,315 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:20:52,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2018-11-28 23:20:52,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:20:52,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:52,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:52,317 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:20:52,317 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:20:52,317 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.alloc(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~short6;havoc insertionSort_#t~mem5; 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 [2018-11-28 23:20:52,317 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~short6;havoc insertionSort_#t~mem5;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 [2018-11-28 23:20:52,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:52,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1301169056, now seen corresponding path program 2 times [2018-11-28 23:20:52,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:52,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:52,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:52,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:52,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:52,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:52,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 3 times [2018-11-28 23:20:52,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:52,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:52,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:52,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:52,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:52,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:52,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1886560891, now seen corresponding path program 1 times [2018-11-28 23:20:52,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:52,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:52,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:52,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:52,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:52,927 WARN L180 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-28 23:20:53,245 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2018-11-28 23:20:53,422 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-28 23:20:53,426 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:53,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:53,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:53,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:53,426 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:53,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:53,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:53,427 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:53,427 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-28 23:20:53,427 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:53,427 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:53,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:53,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:53,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:53,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:53,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:53,630 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2018-11-28 23:20:53,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:53,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:53,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:53,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:53,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:53,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:53,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:53,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:53,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:54,246 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:54,247 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:54,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:54,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:54,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:54,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:54,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:54,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:54,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:54,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:54,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:54,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:54,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:54,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:54,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:54,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:54,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:54,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:54,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:54,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:54,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:54,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:54,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:54,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:54,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:54,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:54,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:54,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:54,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:54,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:54,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:54,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:54,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:54,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:54,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:54,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:54,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:54,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:54,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:54,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:54,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:54,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:54,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:54,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:54,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:54,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:54,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:54,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:54,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:54,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:54,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:54,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:54,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:54,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:54,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:54,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:54,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:54,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:54,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:54,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:54,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:54,332 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:54,367 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:20:54,367 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:20:54,367 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:54,370 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:20:54,372 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:54,372 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2018-11-28 23:20:54,547 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 23:20:54,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:54,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:54,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:54,685 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:20:54,686 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-28 23:20:54,740 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. [2018-11-28 23:20:54,742 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 [2018-11-28 23:20:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:20:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-28 23:20:54,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-28 23:20:54,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:54,743 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:20:54,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:54,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:54,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:54,857 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 [2018-11-28 23:20:54,857 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-28 23:20:55,151 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. [2018-11-28 23:20:55,152 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 [2018-11-28 23:20:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:20:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-28 23:20:55,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-28 23:20:55,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:55,153 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:20:55,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:55,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:55,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:55,233 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 [2018-11-28 23:20:55,233 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-28 23:20:55,289 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. [2018-11-28 23:20:55,290 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 [2018-11-28 23:20:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:20:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-28 23:20:55,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-28 23:20:55,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:55,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-28 23:20:55,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:55,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-28 23:20:55,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:55,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 75 transitions. [2018-11-28 23:20:55,295 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:55,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 0 states and 0 transitions. [2018-11-28 23:20:55,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:20:55,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:20:55,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:20:55,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:20:55,296 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:55,296 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:55,296 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:55,296 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:20:55,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:20:55,299 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:55,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:20:55,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:20:55 BoogieIcfgContainer [2018-11-28 23:20:55,307 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:20:55,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:20:55,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:20:55,308 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:20:55,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:45" (3/4) ... [2018-11-28 23:20:55,314 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:20:55,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:20:55,315 INFO L168 Benchmark]: Toolchain (without parser) took 11141.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 948.7 MB in the beginning and 841.6 MB in the end (delta: 107.0 MB). Peak memory consumption was 317.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:55,317 INFO L168 Benchmark]: CDTParser took 0.17 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. [2018-11-28 23:20:55,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 660.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -151.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:55,320 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:55,321 INFO L168 Benchmark]: Boogie Preprocessor took 46.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:55,321 INFO L168 Benchmark]: RCFGBuilder took 604.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:55,323 INFO L168 Benchmark]: BuchiAutomizer took 9752.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 841.6 MB in the end (delta: 234.6 MB). Peak memory consumption was 323.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:55,324 INFO L168 Benchmark]: Witness Printer took 7.02 ms. Allocated memory is still 1.2 GB. Free memory is still 841.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:55,330 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.17 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 660.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -151.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 604.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9752.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 841.6 MB in the end (delta: 234.6 MB). Peak memory consumption was 323.8 MB. Max. memory is 11.5 GB. * Witness Printer took 7.02 ms. Allocated memory is still 1.2 GB. Free memory is still 841.6 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 9.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.9s. Construction of modules took 0.4s. 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.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital163 mio100 ax111 hnf99 lsp86 ukn75 mio100 lsp65 div100 bol100 ite100 ukn100 eq179 hnf84 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 4 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...