./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/insertionSort_recursive_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-recursive-malloc/insertionSort_recursive_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 647da5540d24322bf98da85423c1800dc68ed16f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:24:06,412 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:24:06,414 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:24:06,426 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:24:06,426 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:24:06,427 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:24:06,429 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:24:06,431 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:24:06,433 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:24:06,434 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:24:06,435 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:24:06,435 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:24:06,437 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:24:06,438 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:24:06,439 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:24:06,440 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:24:06,441 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:24:06,443 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:24:06,446 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:24:06,447 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:24:06,449 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:24:06,450 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:24:06,453 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:24:06,453 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:24:06,453 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:24:06,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:24:06,456 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:24:06,457 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:24:06,458 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:24:06,459 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:24:06,459 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:24:06,460 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:24:06,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:24:06,461 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:24:06,462 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:24:06,463 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:24:06,463 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:24:06,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:24:06,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:24:06,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:24:06,483 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:24:06,483 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:24:06,483 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:24:06,483 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:24:06,484 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:24:06,484 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:24:06,484 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:24:06,485 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:24:06,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:24:06,485 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:24:06,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:24:06,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:24:06,486 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:24:06,487 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:24:06,487 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:24:06,487 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:24:06,487 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:24:06,487 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:24:06,488 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:24:06,488 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:24:06,488 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:24:06,488 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:24:06,488 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:24:06,490 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:24:06,490 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:24:06,491 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:24:06,491 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 -> 647da5540d24322bf98da85423c1800dc68ed16f [2018-11-28 23:24:06,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:24:06,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:24:06,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:24:06,582 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:24:06,584 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:24:06,585 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i [2018-11-28 23:24:06,662 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae85f4d8/7ea5a25d192d4a6d940b337d9f32bf4d/FLAG49cd7425d [2018-11-28 23:24:07,116 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:24:07,116 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i [2018-11-28 23:24:07,123 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae85f4d8/7ea5a25d192d4a6d940b337d9f32bf4d/FLAG49cd7425d [2018-11-28 23:24:07,501 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae85f4d8/7ea5a25d192d4a6d940b337d9f32bf4d [2018-11-28 23:24:07,504 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:24:07,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:24:07,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:07,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:24:07,510 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:24:07,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6664ee2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07, skipping insertion in model container [2018-11-28 23:24:07,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:24:07,544 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:24:07,742 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:07,757 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:24:07,789 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:07,817 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:24:07,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07 WrapperNode [2018-11-28 23:24:07,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:07,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:07,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:24:07,819 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:24:07,829 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:24:07" (1/1) ... [2018-11-28 23:24:07,841 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:24:07" (1/1) ... [2018-11-28 23:24:07,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:07,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:24:07,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:24:07,867 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:24:07,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:24:07,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:24:07,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:24:07,917 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:24:07,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (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:24:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:24:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:24:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2018-11-28 23:24:08,082 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2018-11-28 23:24:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:24:08,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:24:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:24:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:24:08,449 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:24:08,450 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 23:24:08,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:08 BoogieIcfgContainer [2018-11-28 23:24:08,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:24:08,451 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:24:08,451 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:24:08,455 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:24:08,456 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:08,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:24:07" (1/3) ... [2018-11-28 23:24:08,457 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31bec53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:08, skipping insertion in model container [2018-11-28 23:24:08,457 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:08,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (2/3) ... [2018-11-28 23:24:08,458 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31bec53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:08, skipping insertion in model container [2018-11-28 23:24:08,458 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:08,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:08" (3/3) ... [2018-11-28 23:24:08,460 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive_true-termination.c.i [2018-11-28 23:24:08,558 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:24:08,559 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:24:08,559 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:24:08,559 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:24:08,559 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:24:08,560 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:24:08,560 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:24:08,560 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:24:08,560 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:24:08,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-28 23:24:08,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 23:24:08,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:08,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:08,622 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:24:08,622 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:24:08,623 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:24:08,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-28 23:24:08,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 23:24:08,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:08,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:08,626 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:24:08,626 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:24:08,636 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 6#L28true assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 8#L33-3true [2018-11-28 23:24:08,636 INFO L796 eck$LassoCheckResult]: Loop: 8#L33-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 10#L33-2true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 8#L33-3true [2018-11-28 23:24:08,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:08,643 INFO L82 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2018-11-28 23:24:08,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:08,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:08,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:08,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:08,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:08,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:08,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2018-11-28 23:24:08,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:08,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:08,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:08,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:08,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:08,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:08,793 INFO L82 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2018-11-28 23:24:08,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:08,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:08,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:08,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:08,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:08,957 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 23:24:09,222 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 23:24:09,353 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 23:24:09,383 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:09,384 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:09,384 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:09,387 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:09,387 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:09,388 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:09,388 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:09,388 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:09,388 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:24:09,388 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:09,389 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:09,420 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:24:09,427 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:24:09,433 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:24:09,441 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:24:09,702 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 23:24:09,702 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:24:09,712 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:24:10,369 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:10,375 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:10,377 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:24:10,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:10,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:10,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:10,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:10,387 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:24:10,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:10,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:10,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:10,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:10,397 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:24:10,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:10,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:10,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:10,422 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:24:10,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:10,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:10,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:10,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:10,432 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:24:10,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,433 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:10,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,438 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:10,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:10,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:10,459 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:24:10,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:10,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:10,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:10,496 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:24:10,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:10,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:10,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:10,511 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:24:10,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:10,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:10,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:10,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:10,515 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:24:10,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:10,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:10,644 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:10,698 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:24:10,699 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-28 23:24:10,702 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:10,704 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:10,707 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:10,708 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:24:10,793 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:24:10,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:10,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:10,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:10,940 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:24:10,956 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:24:10,957 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2018-11-28 23:24:11,079 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 9 states. [2018-11-28 23:24:11,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:24:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-28 23:24:11,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:24:11,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:11,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:24:11,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:11,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 23:24:11,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:11,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-28 23:24:11,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:24:11,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-11-28 23:24:11,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:24:11,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:24:11,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-11-28 23:24:11,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:11,103 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 23:24:11,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-11-28 23:24:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 23:24:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:24:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-28 23:24:11,134 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 23:24:11,135 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 23:24:11,135 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:24:11,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-28 23:24:11,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:24:11,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:11,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:11,137 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:24:11,137 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:24:11,137 INFO L794 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 130#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 126#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 127#L33-3 assume !(main_~i~0 < main_~n~0); 121#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 120#insertionSortENTRY [2018-11-28 23:24:11,138 INFO L796 eck$LassoCheckResult]: Loop: 120#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 123#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 131#L15-6 assume !true; 132#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 122#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 120#insertionSortENTRY [2018-11-28 23:24:11,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:11,138 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 1 times [2018-11-28 23:24:11,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:11,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:11,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:11,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:11,195 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:24:11,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:11,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:24:11,198 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:11,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:11,199 INFO L82 PathProgramCache]: Analyzing trace with hash 28740467, now seen corresponding path program 1 times [2018-11-28 23:24:11,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:11,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:11,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:11,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:11,208 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:24:11,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:11,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:24:11,209 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:24:11,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:24:11,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:24:11,214 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 2 states. [2018-11-28 23:24:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:11,219 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-11-28 23:24:11,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:24:11,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-28 23:24:11,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:24:11,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 23:24:11,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:24:11,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:24:11,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-28 23:24:11,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:11,224 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:24:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-28 23:24:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 23:24:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:24:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 23:24:11,226 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:24:11,227 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:24:11,227 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:24:11,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-28 23:24:11,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:24:11,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:11,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:11,228 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:24:11,228 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:11,229 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 166#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 162#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 163#L33-3 assume !(main_~i~0 < main_~n~0); 157#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 156#insertionSortENTRY [2018-11-28 23:24:11,229 INFO L796 eck$LassoCheckResult]: Loop: 156#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 159#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 167#L15-6 #t~short4 := ~j~0 > 0; 160#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 161#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 169#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 158#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 156#insertionSortENTRY [2018-11-28 23:24:11,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:11,229 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 2 times [2018-11-28 23:24:11,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:11,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:11,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:11,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:11,299 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:24:11,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:11,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:24:11,300 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:11,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:11,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 1 times [2018-11-28 23:24:11,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:11,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:11,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:11,852 WARN L180 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-11-28 23:24:12,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:24:12,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:24:12,080 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:24:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:12,096 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-11-28 23:24:12,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:24:12,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-11-28 23:24:12,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:24:12,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2018-11-28 23:24:12,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:24:12,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:24:12,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-28 23:24:12,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:12,106 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:24:12,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-28 23:24:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 23:24:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:24:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-28 23:24:12,109 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 23:24:12,109 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 23:24:12,109 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:24:12,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-28 23:24:12,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:24:12,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:12,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:12,111 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:12,111 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:12,111 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 203#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 199#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 200#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 201#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 202#L33-3 assume !(main_~i~0 < main_~n~0); 195#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 193#insertionSortENTRY [2018-11-28 23:24:12,112 INFO L796 eck$LassoCheckResult]: Loop: 193#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 196#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 204#L15-6 #t~short4 := ~j~0 > 0; 197#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 198#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 206#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 194#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 193#insertionSortENTRY [2018-11-28 23:24:12,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash 171927092, now seen corresponding path program 1 times [2018-11-28 23:24:12,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:12,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:12,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:12,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:12,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:12,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:12,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 2 times [2018-11-28 23:24:12,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:12,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:12,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:12,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:12,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:12,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:12,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1744506729, now seen corresponding path program 1 times [2018-11-28 23:24:12,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:12,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:12,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:12,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:12,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:24:12,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:12,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 23:24:12,962 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-11-28 23:24:13,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:24:13,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:24:13,166 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-28 23:24:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:13,253 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-28 23:24:13,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:24:13,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2018-11-28 23:24:13,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:24:13,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2018-11-28 23:24:13,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 23:24:13,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 23:24:13,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2018-11-28 23:24:13,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:13,258 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-28 23:24:13,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2018-11-28 23:24:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-28 23:24:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:24:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-28 23:24:13,260 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 23:24:13,261 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 23:24:13,261 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:24:13,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-28 23:24:13,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:24:13,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:13,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:13,263 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:13,263 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:13,264 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 256#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 252#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 253#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 254#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 255#L33-3 assume !(main_~i~0 < main_~n~0); 248#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 247#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 249#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 257#L15-6 #t~short4 := ~j~0 > 0; 250#L15-1 assume !#t~short4; 251#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 261#L15-7 [2018-11-28 23:24:13,264 INFO L796 eck$LassoCheckResult]: Loop: 261#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 258#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 259#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 266#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 263#L15-6 #t~short4 := ~j~0 > 0; 265#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 264#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 261#L15-7 [2018-11-28 23:24:13,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:13,265 INFO L82 PathProgramCache]: Analyzing trace with hash -332541132, now seen corresponding path program 1 times [2018-11-28 23:24:13,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:13,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:13,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:13,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:13,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:13,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 3 times [2018-11-28 23:24:13,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:13,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:13,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:13,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:13,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:13,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:13,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2143759477, now seen corresponding path program 1 times [2018-11-28 23:24:13,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:13,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:13,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:13,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:13,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:24:13,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:13,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:24:13,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:13,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:14,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:14,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2018-11-28 23:24:14,218 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2018-11-28 23:24:14,515 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-28 23:24:14,887 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2018-11-28 23:24:14,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 23:24:14,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-28 23:24:14,944 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 15 states. [2018-11-28 23:24:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:15,295 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-28 23:24:15,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 23:24:15,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 37 transitions. [2018-11-28 23:24:15,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:24:15,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 27 transitions. [2018-11-28 23:24:15,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 23:24:15,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 23:24:15,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-11-28 23:24:15,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:15,302 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 23:24:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-11-28 23:24:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-28 23:24:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:24:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-28 23:24:15,306 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-28 23:24:15,306 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-28 23:24:15,306 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:24:15,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-28 23:24:15,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:24:15,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:15,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:15,309 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:15,309 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:15,310 INFO L794 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 397#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 392#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 393#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 394#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 395#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 396#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 406#L33-3 assume !(main_~i~0 < main_~n~0); 388#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 387#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 389#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 398#L15-6 #t~short4 := ~j~0 > 0; 390#L15-1 assume !#t~short4; 391#L15-3 [2018-11-28 23:24:15,310 INFO L796 eck$LassoCheckResult]: Loop: 391#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 402#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 400#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 401#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 405#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 404#L15-6 #t~short4 := ~j~0 > 0; 408#L15-1 assume !#t~short4; 391#L15-3 [2018-11-28 23:24:15,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:15,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1905356638, now seen corresponding path program 1 times [2018-11-28 23:24:15,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:15,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:15,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:15,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:15,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:15,336 INFO L82 PathProgramCache]: Analyzing trace with hash -497256520, now seen corresponding path program 1 times [2018-11-28 23:24:15,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:15,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:15,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:15,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:15,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:15,352 INFO L82 PathProgramCache]: Analyzing trace with hash 451769787, now seen corresponding path program 1 times [2018-11-28 23:24:15,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:15,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:15,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:15,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 23:24:15,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:15,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:24:15,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:15,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 23:24:15,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:15,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-28 23:24:16,281 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-11-28 23:24:16,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:24:16,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:24:16,340 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-11-28 23:24:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:16,521 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-28 23:24:16,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:24:16,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-28 23:24:16,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 23:24:16,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2018-11-28 23:24:16,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 23:24:16,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-28 23:24:16,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-11-28 23:24:16,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:16,527 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-28 23:24:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-11-28 23:24:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-11-28 23:24:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:24:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-28 23:24:16,532 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 23:24:16,532 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 23:24:16,532 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:24:16,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-11-28 23:24:16,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 23:24:16,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:16,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:16,534 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:16,534 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:16,535 INFO L794 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 537#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 532#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 533#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 534#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 535#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 536#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 538#L33-3 assume !(main_~i~0 < main_~n~0); 528#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 527#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 529#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 539#L15-6 #t~short4 := ~j~0 > 0; 530#L15-1 assume !#t~short4; 531#L15-3 [2018-11-28 23:24:16,535 INFO L796 eck$LassoCheckResult]: Loop: 531#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 543#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 540#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 541#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 550#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 549#L15-6 #t~short4 := ~j~0 > 0; 547#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 546#L15-3 assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 544#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 545#L15-6 #t~short4 := ~j~0 > 0; 548#L15-1 assume !#t~short4; 531#L15-3 [2018-11-28 23:24:16,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:16,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1905356638, now seen corresponding path program 2 times [2018-11-28 23:24:16,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:16,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:16,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:16,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:16,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:16,559 INFO L82 PathProgramCache]: Analyzing trace with hash -346675363, now seen corresponding path program 1 times [2018-11-28 23:24:16,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:16,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:16,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:16,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:16,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:16,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1466067936, now seen corresponding path program 1 times [2018-11-28 23:24:16,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:16,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:16,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:16,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:16,807 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2018-11-28 23:24:17,261 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-11-28 23:24:17,620 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-28 23:24:18,150 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-11-28 23:24:18,222 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:18,222 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:18,222 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:18,222 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:18,222 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:18,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:18,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:18,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:18,223 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration7_Lasso [2018-11-28 23:24:18,223 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:18,223 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:18,228 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:24:18,232 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:24:18,234 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:24:18,236 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:24:18,238 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:24:18,241 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:24:18,243 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:24:18,246 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:24:18,248 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:24:18,250 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:24:18,253 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:24:18,511 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-11-28 23:24:18,805 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2018-11-28 23:24:18,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:24:18,808 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:24:18,810 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:24:18,812 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:24:18,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,828 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:24:18,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,832 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:24:18,834 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:24:18,838 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:24:19,118 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-11-28 23:24:19,558 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-28 23:24:19,681 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:19,682 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:19,682 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:24:19,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,689 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:24:19,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,695 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:24:19,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:19,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:19,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,702 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:24:19,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,708 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:24:19,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,713 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:24:19,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,719 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:24:19,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,724 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:24:19,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,729 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:24:19,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,737 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:24:19,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,742 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:24:19,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:19,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:19,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,754 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:24:19,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,755 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:19,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,760 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:19,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:19,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,766 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:24:19,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:19,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:19,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,774 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:24:19,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:19,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:19,849 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:19,871 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:24:19,871 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:24:19,872 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:19,874 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:19,874 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:19,874 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~i) = -2*insertionSort_~i + 1 Supporting invariants [] [2018-11-28 23:24:20,003 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-28 23:24:20,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:20,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:20,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:20,980 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 23:24:20,981 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-11-28 23:24:21,749 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5. Second operand 9 states. Result 153 states and 185 transitions. Complement of second has 70 states. [2018-11-28 23:24:21,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:24:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2018-11-28 23:24:21,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 13 letters. Loop has 11 letters. [2018-11-28 23:24:21,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:21,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 24 letters. Loop has 11 letters. [2018-11-28 23:24:21,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:21,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 13 letters. Loop has 22 letters. [2018-11-28 23:24:21,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:21,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 185 transitions. [2018-11-28 23:24:21,770 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-28 23:24:21,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 185 transitions. [2018-11-28 23:24:21,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2018-11-28 23:24:21,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2018-11-28 23:24:21,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 185 transitions. [2018-11-28 23:24:21,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:21,776 INFO L705 BuchiCegarLoop]: Abstraction has 153 states and 185 transitions. [2018-11-28 23:24:21,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 185 transitions. [2018-11-28 23:24:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 45. [2018-11-28 23:24:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 23:24:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-11-28 23:24:21,788 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-28 23:24:21,788 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-28 23:24:21,788 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:24:21,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 55 transitions. [2018-11-28 23:24:21,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 23:24:21,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:21,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:21,792 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:21,792 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:21,792 INFO L794 eck$LassoCheckResult]: Stem: 927#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 921#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 915#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 916#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 918#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 919#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 920#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 922#L33-3 assume !(main_~i~0 < main_~n~0); 911#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 917#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 942#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 941#L15-6 #t~short4 := ~j~0 > 0; 910#L15-1 assume !#t~short4; 912#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 928#L15-7 [2018-11-28 23:24:21,793 INFO L796 eck$LassoCheckResult]: Loop: 928#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 905#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 904#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 906#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 923#L15-6 #t~short4 := ~j~0 > 0; 924#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 945#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 928#L15-7 [2018-11-28 23:24:21,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:21,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1063486350, now seen corresponding path program 2 times [2018-11-28 23:24:21,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:21,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:21,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:21,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:21,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:21,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:21,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 4 times [2018-11-28 23:24:21,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:21,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:21,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:21,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:21,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:21,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961463, now seen corresponding path program 2 times [2018-11-28 23:24:21,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:21,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:21,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:21,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:21,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:22,132 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2018-11-28 23:24:22,461 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2018-11-28 23:24:22,768 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2018-11-28 23:24:23,089 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-11-28 23:24:23,184 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:23,185 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:23,185 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:23,185 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:23,185 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:23,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:23,186 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:23,186 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:23,186 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration8_Lasso [2018-11-28 23:24:23,186 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:23,186 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:23,190 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:24:23,200 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:24:23,201 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:24:23,209 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:24:23,213 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:24:23,215 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:24:23,216 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:24:23,219 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:24:23,420 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2018-11-28 23:24:23,699 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-28 23:24:23,700 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:24:23,703 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:24:23,704 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:24:23,707 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:24:23,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:24:23,715 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:24:23,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:24:23,718 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:24:23,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:24:23,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:24:23,724 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:24:23,726 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:24:23,728 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:24:23,731 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:24:23,755 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:24:23,769 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:24:24,441 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-28 23:24:24,462 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:24,462 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:24,462 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:24:24,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:24,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:24,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:24,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,470 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:24:24,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:24,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:24,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:24,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,475 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:24:24,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:24,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:24,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:24,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,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:24:24,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:24,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:24,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:24,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,485 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:24:24,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:24,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:24,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,488 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:24:24,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:24,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:24,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:24,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,490 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:24:24,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:24,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:24,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:24,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,492 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:24:24,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:24,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:24,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,498 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:24:24,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,499 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:24,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,501 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:24,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:24,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,505 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:24:24,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:24,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:24,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,517 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:24:24,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:24,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:24,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:24,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:24,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:24,573 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:24,624 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:24:24,624 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 23:24:24,625 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:24,627 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:24,628 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:24,628 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_#in~array.base)_2, insertionSort_~array.offset, insertionSort_~j~0) = 1*v_rep(select #length insertionSort_#in~array.base)_2 - 1*insertionSort_~array.offset - 4*insertionSort_~j~0 Supporting invariants [] [2018-11-28 23:24:24,841 INFO L297 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2018-11-28 23:24:24,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:24:25,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:25,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:25,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:25,295 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:24:25,295 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2018-11-28 23:24:25,295 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 55 transitions. cyclomatic complexity: 13 Second operand 8 states. [2018-11-28 23:24:25,548 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 55 transitions. cyclomatic complexity: 13. Second operand 8 states. Result 81 states and 95 transitions. Complement of second has 17 states. [2018-11-28 23:24:25,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:24:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-28 23:24:25,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 14 letters. Loop has 7 letters. [2018-11-28 23:24:25,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:25,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-28 23:24:25,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:25,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 14 letters. Loop has 14 letters. [2018-11-28 23:24:25,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:25,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 95 transitions. [2018-11-28 23:24:25,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 23:24:25,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 69 states and 81 transitions. [2018-11-28 23:24:25,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 23:24:25,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 23:24:25,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 81 transitions. [2018-11-28 23:24:25,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:25,570 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 81 transitions. [2018-11-28 23:24:25,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 81 transitions. [2018-11-28 23:24:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-11-28 23:24:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 23:24:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-11-28 23:24:25,578 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-11-28 23:24:25,578 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-11-28 23:24:25,578 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:24:25,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 76 transitions. [2018-11-28 23:24:25,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 23:24:25,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:25,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:25,580 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:25,580 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:25,580 INFO L794 eck$LassoCheckResult]: Stem: 1198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1191#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1184#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1185#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1188#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1189#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1190#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1207#L33-3 assume !(main_~i~0 < main_~n~0); 1186#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1187#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1217#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1214#L15-6 #t~short4 := ~j~0 > 0; 1210#L15-1 assume !#t~short4; 1209#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1199#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1193#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1226#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1223#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1221#L15-6 #t~short4 := ~j~0 > 0; 1220#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1201#L15-3 assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1202#L15-5 [2018-11-28 23:24:25,580 INFO L796 eck$LassoCheckResult]: Loop: 1202#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1192#L15-6 #t~short4 := ~j~0 > 0; 1194#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1232#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1208#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1175#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1174#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1176#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1205#L15-6 #t~short4 := ~j~0 > 0; 1180#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1181#L15-3 assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1202#L15-5 [2018-11-28 23:24:25,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:25,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961465, now seen corresponding path program 1 times [2018-11-28 23:24:25,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:25,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:25,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:25,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:25,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:25,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:25,605 INFO L82 PathProgramCache]: Analyzing trace with hash -148104591, now seen corresponding path program 1 times [2018-11-28 23:24:25,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:25,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:25,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:25,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:25,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:25,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:25,630 INFO L82 PathProgramCache]: Analyzing trace with hash -670188039, now seen corresponding path program 2 times [2018-11-28 23:24:25,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:25,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:25,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:25,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:25,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 23:24:26,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:26,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:24:26,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:24:26,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:24:26,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:24:26,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:26,315 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 23:24:26,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:26,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-11-28 23:24:26,506 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2018-11-28 23:24:26,693 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2018-11-28 23:24:27,018 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2018-11-28 23:24:27,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:24:27,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:24:27,100 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-28 23:24:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:27,437 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2018-11-28 23:24:27,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 23:24:27,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 110 transitions. [2018-11-28 23:24:27,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 23:24:27,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 91 states and 105 transitions. [2018-11-28 23:24:27,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:24:27,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:24:27,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 105 transitions. [2018-11-28 23:24:27,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:27,442 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 105 transitions. [2018-11-28 23:24:27,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 105 transitions. [2018-11-28 23:24:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-11-28 23:24:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 23:24:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-11-28 23:24:27,448 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-11-28 23:24:27,448 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-11-28 23:24:27,448 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:24:27,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 91 transitions. [2018-11-28 23:24:27,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 23:24:27,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:27,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:27,450 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:27,450 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:27,450 INFO L794 eck$LassoCheckResult]: Stem: 1489#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1482#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1475#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1476#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1479#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1480#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1481#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1501#L33-3 assume !(main_~i~0 < main_~n~0); 1477#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1478#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1510#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1509#L15-6 #t~short4 := ~j~0 > 0; 1507#L15-1 assume !#t~short4; 1504#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1505#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1473#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1534#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1533#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1532#L15-6 #t~short4 := ~j~0 > 0; 1531#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1530#L15-3 assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1528#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1527#L15-6 #t~short4 := ~j~0 > 0; 1519#L15-1 assume !#t~short4; 1513#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1494#L15-7 [2018-11-28 23:24:27,450 INFO L796 eck$LassoCheckResult]: Loop: 1494#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1465#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1464#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1466#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1483#L15-6 #t~short4 := ~j~0 > 0; 1470#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1471#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1494#L15-7 [2018-11-28 23:24:27,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:27,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1796534224, now seen corresponding path program 3 times [2018-11-28 23:24:27,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:27,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:27,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:27,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:27,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:27,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:27,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 5 times [2018-11-28 23:24:27,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:27,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:27,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:27,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:27,490 INFO L82 PathProgramCache]: Analyzing trace with hash 9870329, now seen corresponding path program 4 times [2018-11-28 23:24:27,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:27,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:27,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:27,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:27,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 23:24:27,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:27,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:24:27,695 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:24:27,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:24:27,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:24:27,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 23:24:27,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:27,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-11-28 23:24:28,277 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2018-11-28 23:24:28,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 23:24:28,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2018-11-28 23:24:28,339 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. cyclomatic complexity: 18 Second operand 23 states. [2018-11-28 23:24:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:28,703 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-11-28 23:24:28,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 23:24:28,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 136 transitions. [2018-11-28 23:24:28,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 23:24:28,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 81 states and 94 transitions. [2018-11-28 23:24:28,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 23:24:28,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 23:24:28,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 94 transitions. [2018-11-28 23:24:28,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:28,713 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 94 transitions. [2018-11-28 23:24:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 94 transitions. [2018-11-28 23:24:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-28 23:24:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-28 23:24:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2018-11-28 23:24:28,722 INFO L728 BuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2018-11-28 23:24:28,722 INFO L608 BuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2018-11-28 23:24:28,722 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:24:28,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 93 transitions. [2018-11-28 23:24:28,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 23:24:28,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:28,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:28,725 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:28,725 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:28,725 INFO L794 eck$LassoCheckResult]: Stem: 1829#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1822#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1817#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1818#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1819#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1820#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1821#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1851#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1842#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1841#L33-3 assume !(main_~i~0 < main_~n~0); 1805#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1804#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1806#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1850#L15-6 #t~short4 := ~j~0 > 0; 1848#L15-1 assume !#t~short4; 1844#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1832#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1808#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1807#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1809#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1882#L15-6 #t~short4 := ~j~0 > 0; 1881#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1880#L15-3 assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1879#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1853#L15-6 #t~short4 := ~j~0 > 0; 1849#L15-1 assume !#t~short4; 1845#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1843#L15-7 [2018-11-28 23:24:28,725 INFO L796 eck$LassoCheckResult]: Loop: 1843#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1812#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1828#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1838#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1823#L15-6 #t~short4 := ~j~0 > 0; 1824#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1860#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1843#L15-7 [2018-11-28 23:24:28,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:28,725 INFO L82 PathProgramCache]: Analyzing trace with hash 17685426, now seen corresponding path program 5 times [2018-11-28 23:24:28,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:28,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:28,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:28,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:28,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 6 times [2018-11-28 23:24:28,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:28,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:28,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:28,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1495415351, now seen corresponding path program 6 times [2018-11-28 23:24:28,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:28,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:28,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:28,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:29,205 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2018-11-28 23:24:29,485 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2018-11-28 23:24:29,686 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2018-11-28 23:24:29,837 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2018-11-28 23:24:30,169 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2018-11-28 23:24:30,440 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-11-28 23:24:30,903 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-11-28 23:24:30,991 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:30,991 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:30,991 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:30,991 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:30,991 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:30,992 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:30,992 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:30,992 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:30,992 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration11_Lasso [2018-11-28 23:24:30,992 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:30,992 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:30,997 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:24:31,001 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:24:31,004 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:24:31,024 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:24:31,045 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:24:31,047 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:24:31,050 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:24:31,055 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:24:31,057 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:24:31,282 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-11-28 23:24:31,558 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2018-11-28 23:24:31,559 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:24:31,586 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:24:31,588 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:24:31,590 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:24:31,593 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:24:31,595 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:24:31,599 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:24:31,611 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:24:31,615 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:24:31,617 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:24:31,618 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:24:31,620 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:24:31,623 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:24:31,626 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:24:31,628 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:24:32,171 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:32,171 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:32,171 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:24:32,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,179 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:24:32,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,186 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:24:32,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,188 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:24:32,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:32,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:32,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,195 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:24:32,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,201 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:24:32,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,202 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:24:32,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,204 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:24:32,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,209 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:24:32,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,215 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:24:32,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:32,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:32,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,224 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:24:32,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,229 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:24:32,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:32,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:32,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,250 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:24:32,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,250 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:32,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,255 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:32,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:32,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,265 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:24:32,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:32,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:32,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,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:24:32,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:32,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:32,370 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:32,401 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:24:32,402 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:24:32,402 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:32,403 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:32,403 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:32,403 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_~array.base)_3, insertionSort_~i, insertionSort_~array.offset) = 1*v_rep(select #length insertionSort_~array.base)_3 - 4*insertionSort_~i - 1*insertionSort_~array.offset Supporting invariants [] [2018-11-28 23:24:32,640 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 23:24:32,650 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:24:32,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:32,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:33,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:33,401 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:24:33,402 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 23:24:33,402 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 93 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-11-28 23:24:33,511 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 93 transitions. cyclomatic complexity: 18. Second operand 6 states. Result 137 states and 163 transitions. Complement of second has 14 states. [2018-11-28 23:24:33,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:33,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:24:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-28 23:24:33,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 7 letters. [2018-11-28 23:24:33,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:33,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 7 letters. [2018-11-28 23:24:33,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:33,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 14 letters. [2018-11-28 23:24:33,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:33,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 163 transitions. [2018-11-28 23:24:33,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:24:33,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 92 states and 107 transitions. [2018-11-28 23:24:33,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-28 23:24:33,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-28 23:24:33,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 107 transitions. [2018-11-28 23:24:33,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:33,528 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 107 transitions. [2018-11-28 23:24:33,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 107 transitions. [2018-11-28 23:24:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2018-11-28 23:24:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 23:24:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2018-11-28 23:24:33,535 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-11-28 23:24:33,535 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-11-28 23:24:33,535 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 23:24:33,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 100 transitions. [2018-11-28 23:24:33,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:24:33,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:33,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:33,537 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:33,537 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:24:33,537 INFO L794 eck$LassoCheckResult]: Stem: 2219#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2214#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 2209#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 2210#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2211#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2212#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2213#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2215#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2235#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2234#L33-3 assume !(main_~i~0 < main_~n~0); 2198#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 2197#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2199#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2229#L15-6 #t~short4 := ~j~0 > 0; 2236#L15-1 assume !#t~short4; 2225#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 2226#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2207#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2275#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2274#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2271#L15-6 #t~short4 := ~j~0 > 0; 2206#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 2208#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 2277#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2201#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2200#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2202#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2273#L15-6 #t~short4 := ~j~0 > 0; 2203#L15-1 [2018-11-28 23:24:33,538 INFO L796 eck$LassoCheckResult]: Loop: 2203#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 2205#L15-3 assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 2232#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 2216#L15-6 #t~short4 := ~j~0 > 0; 2203#L15-1 [2018-11-28 23:24:33,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:33,538 INFO L82 PathProgramCache]: Analyzing trace with hash 496161610, now seen corresponding path program 3 times [2018-11-28 23:24:33,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:33,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:33,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:33,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:33,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:33,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:33,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 1 times [2018-11-28 23:24:33,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:33,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:33,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:33,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:33,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:33,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:33,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1509363707, now seen corresponding path program 7 times [2018-11-28 23:24:33,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:33,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:33,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:33,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:33,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:33,926 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-11-28 23:24:34,225 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-11-28 23:24:34,548 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-11-28 23:24:34,722 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2018-11-28 23:24:35,152 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-28 23:24:35,645 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-11-28 23:24:36,157 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-11-28 23:24:36,274 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-28 23:24:36,278 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:36,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:36,278 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:36,278 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:36,279 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:36,279 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:36,279 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:36,279 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:36,279 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration12_Lasso [2018-11-28 23:24:36,279 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:36,279 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:36,284 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:24:36,291 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:24:36,294 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:24:36,298 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:24:36,493 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-11-28 23:24:36,694 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-11-28 23:24:36,695 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:24:36,697 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:24:36,699 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:24:36,701 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:24:36,705 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:24:36,707 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:24:36,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:24:36,712 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:24:36,715 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:24:36,718 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:24:36,719 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:24:36,721 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:24:36,723 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:24:36,726 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:24:36,728 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:24:36,732 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:24:36,734 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:24:36,736 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:24:36,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:24:37,132 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-11-28 23:24:37,191 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:37,191 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:37,191 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:24:37,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,194 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:24:37,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,196 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:24:37,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:37,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:37,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,199 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:24:37,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,200 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:24:37,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:37,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:37,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,207 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:24:37,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,209 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:24:37,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,211 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:24:37,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,211 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:24:37,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,216 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 23:24:37,216 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:24:37,296 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:37,388 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 23:24:37,388 INFO L444 ModelExtractionUtils]: 44 out of 56 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-28 23:24:37,389 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:37,391 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 23:24:37,392 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:37,392 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~array.offset, insertionSort_~j~0) = 1*insertionSort_~array.offset + 4*insertionSort_~j~0 Supporting invariants [] [2018-11-28 23:24:37,543 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 23:24:37,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:37,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:37,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:37,681 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:24:37,681 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:24:37,681 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-28 23:24:37,690 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 90 states and 105 transitions. Complement of second has 8 states. [2018-11-28 23:24:37,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-28 23:24:37,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-28 23:24:37,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:37,694 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:37,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:37,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:37,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:37,842 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:24:37,843 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:24:37,843 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-28 23:24:37,856 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 90 states and 105 transitions. Complement of second has 8 states. [2018-11-28 23:24:37,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-28 23:24:37,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-28 23:24:37,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:37,859 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:37,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:37,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:37,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:37,940 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:24:37,940 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:24:37,940 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-28 23:24:37,966 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 131 states and 157 transitions. Complement of second has 9 states. [2018-11-28 23:24:37,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-28 23:24:37,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-28 23:24:37,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:37,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-28 23:24:37,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:37,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-28 23:24:37,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:37,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 157 transitions. [2018-11-28 23:24:37,974 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:37,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 0 states and 0 transitions. [2018-11-28 23:24:37,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:24:37,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:24:37,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:24:37,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:37,975 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:37,975 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:37,975 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:37,975 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 23:24:37,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:24:37,975 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:37,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:24:37,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:24:37 BoogieIcfgContainer [2018-11-28 23:24:37,983 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:24:37,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:24:37,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:24:37,984 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:24:37,985 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:08" (3/4) ... [2018-11-28 23:24:37,988 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:24:37,988 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:24:37,989 INFO L168 Benchmark]: Toolchain (without parser) took 30485.23 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 449.8 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -227.1 MB). Peak memory consumption was 222.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:37,991 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:37,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.03 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:37,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.02 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:37,992 INFO L168 Benchmark]: Boogie Preprocessor took 49.55 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:37,993 INFO L168 Benchmark]: RCFGBuilder took 533.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:37,994 INFO L168 Benchmark]: BuchiAutomizer took 29532.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 300.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -49.3 MB). Peak memory consumption was 251.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:37,995 INFO L168 Benchmark]: Witness Printer took 4.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:37,999 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.03 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.02 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.55 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 533.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29532.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 300.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -49.3 MB). Peak memory consumption was 251.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (7 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 1 and consists of 12 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -1 * array + -4 * j and consists of 8 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -4 * i + -1 * array and consists of 6 locations. One nondeterministic module has affine ranking function array + 4 * j and consists of 4 locations. 7 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.4s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 23.8s. Construction of modules took 0.9s. Büchi inclusion checks took 4.3s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 146 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 85 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/3 HoareTripleCheckerStatistics: 180 SDtfs, 271 SDslu, 400 SDs, 0 SdLazy, 707 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU1 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital241 mio100 ax100 hnf99 lsp93 ukn81 mio100 lsp58 div100 bol101 ite100 ukn100 eq168 hnf88 smp95 dnf122 smp92 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 181ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...