./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-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-0ed9222-m [2019-01-14 02:48:01,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:48:01,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:48:01,554 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:48:01,554 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:48:01,555 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:48:01,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:48:01,558 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:48:01,560 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:48:01,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:48:01,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:48:01,562 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:48:01,563 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:48:01,564 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:48:01,565 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:48:01,566 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:48:01,567 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:48:01,569 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:48:01,571 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:48:01,572 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:48:01,574 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:48:01,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:48:01,578 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:48:01,578 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:48:01,578 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:48:01,579 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:48:01,583 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:48:01,584 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:48:01,584 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:48:01,586 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:48:01,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:48:01,588 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:48:01,588 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:48:01,588 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:48:01,592 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:48:01,593 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:48:01,595 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:48:01,625 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:48:01,625 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:48:01,627 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:48:01,629 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:48:01,630 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:48:01,630 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:48:01,630 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:48:01,630 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:48:01,630 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:48:01,631 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:48:01,631 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:48:01,631 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:48:01,631 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:48:01,631 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:48:01,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:48:01,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:48:01,634 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:48:01,634 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:48:01,634 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:48:01,635 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:48:01,635 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:48:01,635 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:48:01,635 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:48:01,635 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:48:01,636 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:48:01,636 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:48:01,636 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:48:01,636 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:48:01,638 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:48:01,639 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 [2019-01-14 02:48:01,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:48:01,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:48:01,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:48:01,706 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:48:01,706 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:48:01,708 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i [2019-01-14 02:48:01,765 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b355da82a/059fb08289ae4f57af6f9f83ee1ce86c/FLAGc4d3b5455 [2019-01-14 02:48:02,167 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:48:02,168 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i [2019-01-14 02:48:02,176 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b355da82a/059fb08289ae4f57af6f9f83ee1ce86c/FLAGc4d3b5455 [2019-01-14 02:48:02,522 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b355da82a/059fb08289ae4f57af6f9f83ee1ce86c [2019-01-14 02:48:02,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:48:02,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:48:02,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:48:02,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:48:02,531 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:48:02,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:48:02" (1/1) ... [2019-01-14 02:48:02,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c8caa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:02, skipping insertion in model container [2019-01-14 02:48:02,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:48:02" (1/1) ... [2019-01-14 02:48:02,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:48:02,561 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:48:02,724 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:48:02,744 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:48:02,779 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:48:02,808 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:48:02,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:02 WrapperNode [2019-01-14 02:48:02,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:48:02,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:48:02,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:48:02,810 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:48:02,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:02" (1/1) ... [2019-01-14 02:48:02,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:02" (1/1) ... [2019-01-14 02:48:02,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:48:02,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:48:02,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:48:02,866 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:48:02,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:02" (1/1) ... [2019-01-14 02:48:02,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:02" (1/1) ... [2019-01-14 02:48:02,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:02" (1/1) ... [2019-01-14 02:48:02,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:02" (1/1) ... [2019-01-14 02:48:02,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:02" (1/1) ... [2019-01-14 02:48:02,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:02" (1/1) ... [2019-01-14 02:48:02,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:02" (1/1) ... [2019-01-14 02:48:02,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:48:02,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:48:02,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:48:02,912 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:48:02,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:03,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:48:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:48:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2019-01-14 02:48:03,065 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2019-01-14 02:48:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:48:03,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:48:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:48:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:48:03,462 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:48:03,463 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:48:03,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:03 BoogieIcfgContainer [2019-01-14 02:48:03,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:48:03,464 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:48:03,464 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:48:03,467 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:48:03,468 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:03,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:48:02" (1/3) ... [2019-01-14 02:48:03,469 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3651fa9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:48:03, skipping insertion in model container [2019-01-14 02:48:03,469 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:03,469 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:48:02" (2/3) ... [2019-01-14 02:48:03,470 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3651fa9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:48:03, skipping insertion in model container [2019-01-14 02:48:03,470 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:48:03,470 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:03" (3/3) ... [2019-01-14 02:48:03,472 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive_true-termination.c.i [2019-01-14 02:48:03,529 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:48:03,529 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:48:03,530 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:48:03,530 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:48:03,530 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:48:03,530 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:48:03,530 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:48:03,530 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:48:03,530 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:48:03,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-14 02:48:03,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:48:03,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:03,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:03,581 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:48:03,582 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:48:03,582 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:48:03,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-14 02:48:03,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:48:03,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:03,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:03,585 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:48:03,586 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:48:03,594 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.allocOnHeap(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 [2019-01-14 02:48:03,595 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 [2019-01-14 02:48:03,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:03,601 INFO L82 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2019-01-14 02:48:03,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:03,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:03,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:03,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:03,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:03,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:03,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2019-01-14 02:48:03,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:03,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:03,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:03,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:03,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:03,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:03,748 INFO L82 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2019-01-14 02:48:03,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:03,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:03,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:03,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:03,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:04,054 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 02:48:04,214 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 02:48:04,223 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:04,224 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:04,225 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:04,225 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:04,225 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:04,225 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:04,226 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:04,226 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:04,226 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:48:04,226 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:04,226 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:04,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,757 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-14 02:48:05,112 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 02:48:05,252 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:05,257 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:05,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:05,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:05,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:05,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:05,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:05,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:05,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:05,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:05,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:05,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:05,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:05,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,288 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:48:05,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,293 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:48:05,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:05,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:05,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:05,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:05,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:05,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:05,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:05,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:05,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:05,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:05,486 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:05,540 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:48:05,540 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-01-14 02:48:05,543 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:05,545 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:05,546 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:05,546 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 [] [2019-01-14 02:48:05,627 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:48:05,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:05,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:05,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:05,774 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:48:05,776 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2019-01-14 02:48:05,857 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. [2019-01-14 02:48:05,858 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 [2019-01-14 02:48:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:48:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2019-01-14 02:48:05,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:48:05,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:05,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:48:05,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:05,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-14 02:48:05,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:05,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-14 02:48:05,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:48:05,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-01-14 02:48:05,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:48:05,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:48:05,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-01-14 02:48:05,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:05,885 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-14 02:48:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-01-14 02:48:05,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-14 02:48:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:48:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-01-14 02:48:05,916 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-14 02:48:05,917 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-14 02:48:05,917 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:48:05,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-01-14 02:48:05,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:48:05,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:05,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:05,919 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:48:05,919 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:48:05,919 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.allocOnHeap(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 [2019-01-14 02:48:05,919 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 [2019-01-14 02:48:05,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:05,921 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 1 times [2019-01-14 02:48:05,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:05,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:05,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:05,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:05,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:05,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:48:05,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:48:05,991 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:48:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash 28740467, now seen corresponding path program 1 times [2019-01-14 02:48:05,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:05,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:05,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:05,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:05,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:06,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:48:06,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:48:06,001 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:48:06,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:48:06,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:48:06,009 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 2 states. [2019-01-14 02:48:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:06,017 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-01-14 02:48:06,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:48:06,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-01-14 02:48:06,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:48:06,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-01-14 02:48:06,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:48:06,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:48:06,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-01-14 02:48:06,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:06,030 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 02:48:06,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-01-14 02:48:06,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-14 02:48:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:48:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-01-14 02:48:06,036 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 02:48:06,036 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 02:48:06,036 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:48:06,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-01-14 02:48:06,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:48:06,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:06,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:06,041 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:48:06,041 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:06,042 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.allocOnHeap(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 [2019-01-14 02:48:06,042 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 [2019-01-14 02:48:06,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:06,042 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 2 times [2019-01-14 02:48:06,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:06,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:06,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:06,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:06,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:48:06,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:48:06,086 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:48:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:06,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 1 times [2019-01-14 02:48:06,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:06,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:06,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:06,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:06,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:06,874 WARN L181 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-01-14 02:48:06,996 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-01-14 02:48:07,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:48:07,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:48:07,146 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:48:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:07,180 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-14 02:48:07,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:48:07,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2019-01-14 02:48:07,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:48:07,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2019-01-14 02:48:07,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:48:07,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:48:07,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-01-14 02:48:07,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:07,183 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-14 02:48:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-01-14 02:48:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-14 02:48:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:48:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-01-14 02:48:07,187 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-14 02:48:07,187 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-14 02:48:07,187 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:48:07,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-01-14 02:48:07,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:48:07,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:07,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:07,189 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:07,190 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:07,190 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.allocOnHeap(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 [2019-01-14 02:48:07,190 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 [2019-01-14 02:48:07,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:07,190 INFO L82 PathProgramCache]: Analyzing trace with hash 171927092, now seen corresponding path program 1 times [2019-01-14 02:48:07,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:07,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:07,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:07,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:07,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:07,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:07,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 2 times [2019-01-14 02:48:07,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:07,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:07,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:07,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:07,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:07,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:07,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1744506729, now seen corresponding path program 1 times [2019-01-14 02:48:07,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:07,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:07,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:07,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:07,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:48:07,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:48:07,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 02:48:07,711 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-01-14 02:48:07,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:48:07,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:48:07,910 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-01-14 02:48:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:07,993 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-14 02:48:07,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:48:07,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2019-01-14 02:48:07,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:48:07,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2019-01-14 02:48:07,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 02:48:07,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 02:48:07,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-01-14 02:48:07,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:07,999 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-14 02:48:07,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-01-14 02:48:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-01-14 02:48:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 02:48:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-01-14 02:48:08,003 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 02:48:08,003 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 02:48:08,003 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:48:08,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-01-14 02:48:08,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:48:08,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:08,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:08,006 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:08,006 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:08,006 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.allocOnHeap(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 [2019-01-14 02:48:08,006 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 [2019-01-14 02:48:08,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:08,007 INFO L82 PathProgramCache]: Analyzing trace with hash -332541132, now seen corresponding path program 1 times [2019-01-14 02:48:08,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:08,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:08,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:08,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:08,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:08,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 3 times [2019-01-14 02:48:08,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:08,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:08,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:08,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:08,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2143759477, now seen corresponding path program 1 times [2019-01-14 02:48:08,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:08,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:08,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:08,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:08,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:48:08,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:48:08,239 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 [2019-01-14 02:48:08,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:08,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:08,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:48:08,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2019-01-14 02:48:08,610 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-01-14 02:48:08,892 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 02:48:09,094 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-14 02:48:09,318 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-14 02:48:09,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 02:48:09,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-01-14 02:48:09,398 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 15 states. [2019-01-14 02:48:09,899 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:48:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:10,149 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-14 02:48:10,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 02:48:10,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 37 transitions. [2019-01-14 02:48:10,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:48:10,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 27 transitions. [2019-01-14 02:48:10,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 02:48:10,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 02:48:10,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-01-14 02:48:10,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:10,154 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-14 02:48:10,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-01-14 02:48:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-01-14 02:48:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 02:48:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-01-14 02:48:10,158 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-14 02:48:10,158 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-14 02:48:10,158 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:48:10,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2019-01-14 02:48:10,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:48:10,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:10,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:10,160 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:10,160 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:10,160 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.allocOnHeap(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 [2019-01-14 02:48:10,160 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 [2019-01-14 02:48:10,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:10,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1905356638, now seen corresponding path program 1 times [2019-01-14 02:48:10,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:10,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:10,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:10,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:10,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:10,199 INFO L82 PathProgramCache]: Analyzing trace with hash -497256520, now seen corresponding path program 1 times [2019-01-14 02:48:10,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:10,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:10,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:10,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:10,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:10,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:10,213 INFO L82 PathProgramCache]: Analyzing trace with hash 451769787, now seen corresponding path program 1 times [2019-01-14 02:48:10,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:10,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:10,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:10,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:10,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 02:48:10,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:48:10,695 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 [2019-01-14 02:48:10,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:10,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 02:48:10,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:48:10,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-01-14 02:48:11,201 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-14 02:48:11,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 02:48:11,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-14 02:48:11,258 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 11 states. [2019-01-14 02:48:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:11,411 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-14 02:48:11,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 02:48:11,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2019-01-14 02:48:11,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-14 02:48:11,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2019-01-14 02:48:11,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-14 02:48:11,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-14 02:48:11,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2019-01-14 02:48:11,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:11,416 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-14 02:48:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2019-01-14 02:48:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-01-14 02:48:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 02:48:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-01-14 02:48:11,421 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-14 02:48:11,421 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-14 02:48:11,421 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:48:11,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2019-01-14 02:48:11,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:48:11,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:11,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:11,422 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:11,422 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:11,423 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.allocOnHeap(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 [2019-01-14 02:48:11,423 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 [2019-01-14 02:48:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1905356638, now seen corresponding path program 2 times [2019-01-14 02:48:11,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:11,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:11,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:11,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:11,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:11,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:11,442 INFO L82 PathProgramCache]: Analyzing trace with hash -346675363, now seen corresponding path program 1 times [2019-01-14 02:48:11,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:11,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:11,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:11,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:11,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:11,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:11,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1466067936, now seen corresponding path program 1 times [2019-01-14 02:48:11,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:11,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:11,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:11,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:11,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:11,665 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-01-14 02:48:11,965 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-14 02:48:12,147 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-01-14 02:48:12,253 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-01-14 02:48:12,534 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-01-14 02:48:12,878 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-01-14 02:48:12,951 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:12,951 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:12,951 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:12,951 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:12,952 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:12,952 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:12,952 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:12,952 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:12,952 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration7_Lasso [2019-01-14 02:48:12,952 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:12,952 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:12,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:13,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:13,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:13,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:13,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:13,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:13,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:13,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:13,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:13,259 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-01-14 02:48:13,549 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-01-14 02:48:13,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:13,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:13,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:13,856 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-01-14 02:48:14,011 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 02:48:14,423 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:14,424 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:14,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:14,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:14,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,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 [2019-01-14 02:48:14,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:14,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:14,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:14,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:14,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,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 [2019-01-14 02:48:14,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:14,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:14,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:14,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:14,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:14,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,546 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:48:14,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,548 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:48:14,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:14,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:14,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:14,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:14,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:14,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:14,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:14,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:14,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:14,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:14,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:14,622 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:14,648 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:48:14,648 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:48:14,649 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:14,649 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:14,651 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:14,651 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~i) = -2*insertionSort_~i + 1 Supporting invariants [] [2019-01-14 02:48:14,783 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-01-14 02:48:15,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:15,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:15,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:15,747 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 [2019-01-14 02:48:15,747 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5 Second operand 9 states. [2019-01-14 02:48:16,062 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2019-01-14 02:48:16,585 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. [2019-01-14 02:48:16,586 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 [2019-01-14 02:48:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:48:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2019-01-14 02:48:16,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 13 letters. Loop has 11 letters. [2019-01-14 02:48:16,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:16,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 24 letters. Loop has 11 letters. [2019-01-14 02:48:16,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:16,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 13 letters. Loop has 22 letters. [2019-01-14 02:48:16,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:16,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 185 transitions. [2019-01-14 02:48:16,596 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-01-14 02:48:16,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 185 transitions. [2019-01-14 02:48:16,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2019-01-14 02:48:16,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2019-01-14 02:48:16,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 185 transitions. [2019-01-14 02:48:16,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:16,603 INFO L706 BuchiCegarLoop]: Abstraction has 153 states and 185 transitions. [2019-01-14 02:48:16,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 185 transitions. [2019-01-14 02:48:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 45. [2019-01-14 02:48:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 02:48:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2019-01-14 02:48:16,611 INFO L729 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-01-14 02:48:16,612 INFO L609 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-01-14 02:48:16,612 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:48:16,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 55 transitions. [2019-01-14 02:48:16,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-14 02:48:16,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:16,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:16,616 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:16,616 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:16,617 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.allocOnHeap(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 [2019-01-14 02:48:16,617 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 [2019-01-14 02:48:16,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:16,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1063486350, now seen corresponding path program 2 times [2019-01-14 02:48:16,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:16,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:16,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:16,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:16,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:16,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 4 times [2019-01-14 02:48:16,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:16,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:16,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:16,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:16,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:16,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:16,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961463, now seen corresponding path program 2 times [2019-01-14 02:48:16,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:16,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:16,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:16,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:16,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:16,861 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-01-14 02:48:17,167 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-14 02:48:17,542 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-01-14 02:48:17,833 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-01-14 02:48:17,908 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:17,908 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:17,908 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:17,909 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:17,909 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:17,909 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:17,909 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:17,909 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:17,909 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration8_Lasso [2019-01-14 02:48:17,910 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:17,910 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:17,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:17,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:18,172 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-01-14 02:48:18,458 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-01-14 02:48:18,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:18,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:18,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:18,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:18,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:18,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:18,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:18,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:19,245 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 02:48:19,329 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:19,329 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:19,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:19,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:19,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:19,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:19,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:19,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:19,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:19,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:19,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:19,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:19,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:19,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:19,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:19,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:19,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:19,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:19,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:19,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:19,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:19,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:19,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:19,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:19,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:19,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:19,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:19,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:19,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:19,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:19,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:19,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:19,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:19,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:19,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:19,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:19,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:19,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:19,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:19,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:19,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:19,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:19,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:19,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:19,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:19,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:19,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,392 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:48:19,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,394 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:48:19,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:19,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:19,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:19,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:19,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:19,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:19,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:19,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:19,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:19,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:19,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:19,433 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:19,470 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:48:19,470 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:48:19,471 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:19,471 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:19,472 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:19,472 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_~array.base)_2, insertionSort_~array.offset, insertionSort_~j~0) = 1*v_rep(select #length insertionSort_~array.base)_2 - 1*insertionSort_~array.offset - 4*insertionSort_~j~0 Supporting invariants [] [2019-01-14 02:48:19,624 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-01-14 02:48:19,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:48:19,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:19,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:19,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:19,976 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-14 02:48:19,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 55 transitions. cyclomatic complexity: 13 Second operand 7 states. [2019-01-14 02:48:20,156 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 55 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 81 states and 95 transitions. Complement of second has 16 states. [2019-01-14 02:48:20,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:48:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-01-14 02:48:20,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 14 letters. Loop has 7 letters. [2019-01-14 02:48:20,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:20,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 21 letters. Loop has 7 letters. [2019-01-14 02:48:20,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:20,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 14 letters. Loop has 14 letters. [2019-01-14 02:48:20,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:20,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 95 transitions. [2019-01-14 02:48:20,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-14 02:48:20,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 69 states and 81 transitions. [2019-01-14 02:48:20,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 02:48:20,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-14 02:48:20,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 81 transitions. [2019-01-14 02:48:20,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:20,176 INFO L706 BuchiCegarLoop]: Abstraction has 69 states and 81 transitions. [2019-01-14 02:48:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 81 transitions. [2019-01-14 02:48:20,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2019-01-14 02:48:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 02:48:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2019-01-14 02:48:20,182 INFO L729 BuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2019-01-14 02:48:20,182 INFO L609 BuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2019-01-14 02:48:20,182 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:48:20,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 76 transitions. [2019-01-14 02:48:20,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-14 02:48:20,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:20,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:20,186 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:20,186 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:20,186 INFO L794 eck$LassoCheckResult]: Stem: 1194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1188#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; 1181#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1182#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; 1185#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1186#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; 1187#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1202#L33-3 assume !(main_~i~0 < main_~n~0); 1183#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1184#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1212#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; 1211#L15-6 #t~short4 := ~j~0 > 0; 1208#L15-1 assume !#t~short4; 1207#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1195#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);< 1219#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1218#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; 1215#L15-6 #t~short4 := ~j~0 > 0; 1213#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; 1197#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; 1198#L15-5 [2019-01-14 02:48:20,186 INFO L796 eck$LassoCheckResult]: Loop: 1198#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1200#L15-6 #t~short4 := ~j~0 > 0; 1231#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; 1227#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1203#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1172#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1171#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1173#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; 1189#L15-6 #t~short4 := ~j~0 > 0; 1177#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; 1178#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; 1198#L15-5 [2019-01-14 02:48:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961465, now seen corresponding path program 1 times [2019-01-14 02:48:20,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:20,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:20,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:20,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:20,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:20,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:20,215 INFO L82 PathProgramCache]: Analyzing trace with hash -148104591, now seen corresponding path program 1 times [2019-01-14 02:48:20,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:20,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:20,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:20,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:20,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash -670188039, now seen corresponding path program 2 times [2019-01-14 02:48:20,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:20,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:20,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:20,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:20,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 02:48:20,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:48:20,755 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 [2019-01-14 02:48:20,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:48:20,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:48:20,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:48:20,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 02:48:20,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:48:20,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2019-01-14 02:48:21,004 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-01-14 02:48:21,159 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-01-14 02:48:21,516 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-01-14 02:48:21,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 02:48:21,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-01-14 02:48:21,597 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-01-14 02:48:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:21,926 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2019-01-14 02:48:21,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 02:48:21,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 110 transitions. [2019-01-14 02:48:21,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-14 02:48:21,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 91 states and 105 transitions. [2019-01-14 02:48:21,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-14 02:48:21,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-14 02:48:21,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 105 transitions. [2019-01-14 02:48:21,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:21,934 INFO L706 BuchiCegarLoop]: Abstraction has 91 states and 105 transitions. [2019-01-14 02:48:21,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 105 transitions. [2019-01-14 02:48:21,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2019-01-14 02:48:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-14 02:48:21,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2019-01-14 02:48:21,942 INFO L729 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2019-01-14 02:48:21,942 INFO L609 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2019-01-14 02:48:21,942 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:48:21,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 91 transitions. [2019-01-14 02:48:21,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-14 02:48:21,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:21,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:21,947 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:21,947 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:21,948 INFO L794 eck$LassoCheckResult]: Stem: 1486#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1479#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; 1472#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1473#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; 1476#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1477#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; 1478#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1498#L33-3 assume !(main_~i~0 < main_~n~0); 1474#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1475#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1507#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; 1506#L15-6 #t~short4 := ~j~0 > 0; 1504#L15-1 assume !#t~short4; 1501#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1502#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1470#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1531#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1530#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; 1529#L15-6 #t~short4 := ~j~0 > 0; 1528#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; 1527#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; 1525#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1524#L15-6 #t~short4 := ~j~0 > 0; 1516#L15-1 assume !#t~short4; 1510#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1491#L15-7 [2019-01-14 02:48:21,948 INFO L796 eck$LassoCheckResult]: Loop: 1491#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1462#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1461#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1463#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; 1480#L15-6 #t~short4 := ~j~0 > 0; 1467#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; 1468#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1491#L15-7 [2019-01-14 02:48:21,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1796534224, now seen corresponding path program 3 times [2019-01-14 02:48:21,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:21,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:21,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:21,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:21,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:21,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:21,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 5 times [2019-01-14 02:48:21,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:21,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:21,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:21,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:21,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:21,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:21,988 INFO L82 PathProgramCache]: Analyzing trace with hash 9870329, now seen corresponding path program 4 times [2019-01-14 02:48:21,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:21,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:21,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:21,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:21,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 02:48:22,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:48:22,734 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 [2019-01-14 02:48:22,744 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 02:48:22,769 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 02:48:22,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:48:22,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 02:48:22,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:48:22,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2019-01-14 02:48:23,365 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-14 02:48:23,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 02:48:23,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-01-14 02:48:23,423 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. cyclomatic complexity: 18 Second operand 23 states. [2019-01-14 02:48:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:23,802 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2019-01-14 02:48:23,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 02:48:23,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 136 transitions. [2019-01-14 02:48:23,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-14 02:48:23,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 81 states and 94 transitions. [2019-01-14 02:48:23,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 02:48:23,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 02:48:23,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 94 transitions. [2019-01-14 02:48:23,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:23,813 INFO L706 BuchiCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-01-14 02:48:23,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 94 transitions. [2019-01-14 02:48:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-01-14 02:48:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 02:48:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2019-01-14 02:48:23,818 INFO L729 BuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2019-01-14 02:48:23,818 INFO L609 BuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2019-01-14 02:48:23,818 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:48:23,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 93 transitions. [2019-01-14 02:48:23,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-14 02:48:23,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:23,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:23,823 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:23,823 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:23,826 INFO L794 eck$LassoCheckResult]: Stem: 1826#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1820#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; 1812#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1813#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; 1816#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1868#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; 1817#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; 1818#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1837#L33-3 assume !(main_~i~0 < main_~n~0); 1814#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1815#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1850#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; 1847#L15-6 #t~short4 := ~j~0 > 0; 1845#L15-1 assume !#t~short4; 1839#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1840#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1810#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1876#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1875#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; 1874#L15-6 #t~short4 := ~j~0 > 0; 1873#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; 1872#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; 1864#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1865#L15-6 #t~short4 := ~j~0 > 0; 1846#L15-1 assume !#t~short4; 1843#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1831#L15-7 [2019-01-14 02:48:23,826 INFO L796 eck$LassoCheckResult]: Loop: 1831#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1802#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1801#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1803#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; 1821#L15-6 #t~short4 := ~j~0 > 0; 1807#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; 1808#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1831#L15-7 [2019-01-14 02:48:23,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:23,826 INFO L82 PathProgramCache]: Analyzing trace with hash 17685426, now seen corresponding path program 5 times [2019-01-14 02:48:23,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:23,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:23,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:23,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:23,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:23,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:23,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 6 times [2019-01-14 02:48:23,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:23,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:23,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:23,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:23,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:23,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:23,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1495415351, now seen corresponding path program 6 times [2019-01-14 02:48:23,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:23,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:23,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:23,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:23,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:24,054 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-01-14 02:48:24,332 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-14 02:48:24,594 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-01-14 02:48:24,742 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-14 02:48:25,066 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-01-14 02:48:25,406 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-01-14 02:48:25,989 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 108 [2019-01-14 02:48:26,210 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-14 02:48:26,213 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:26,213 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:26,213 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:26,213 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:26,214 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:26,214 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:26,214 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:26,214 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:26,214 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration11_Lasso [2019-01-14 02:48:26,214 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:26,214 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:26,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:26,447 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-01-14 02:48:26,673 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-01-14 02:48:26,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:27,198 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:27,199 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:27,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 [2019-01-14 02:48:27,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,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 [2019-01-14 02:48:27,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:27,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:27,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,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 [2019-01-14 02:48:27,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:27,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:27,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:27,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:27,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:27,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:27,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:27,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:27,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:27,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,352 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:48:27,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,354 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:48:27,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:27,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:27,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:27,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:27,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:27,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:27,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:27,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:27,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:27,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:27,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:27,422 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:27,467 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:48:27,467 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 02:48:27,468 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:27,468 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:27,469 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:27,469 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~size, insertionSort_~i) = 1*insertionSort_~size - 1*insertionSort_~i Supporting invariants [] [2019-01-14 02:48:27,697 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 02:48:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:28,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:28,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:28,173 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 [2019-01-14 02:48:28,173 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 93 transitions. cyclomatic complexity: 18 Second operand 6 states. [2019-01-14 02:48:28,228 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. [2019-01-14 02:48:28,229 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 [2019-01-14 02:48:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:48:28,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-01-14 02:48:28,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 7 letters. [2019-01-14 02:48:28,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:28,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 7 letters. [2019-01-14 02:48:28,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:28,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 14 letters. [2019-01-14 02:48:28,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:28,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 163 transitions. [2019-01-14 02:48:28,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:48:28,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 92 states and 107 transitions. [2019-01-14 02:48:28,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-14 02:48:28,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 02:48:28,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 107 transitions. [2019-01-14 02:48:28,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:28,239 INFO L706 BuchiCegarLoop]: Abstraction has 92 states and 107 transitions. [2019-01-14 02:48:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 107 transitions. [2019-01-14 02:48:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2019-01-14 02:48:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-14 02:48:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2019-01-14 02:48:28,250 INFO L729 BuchiCegarLoop]: Abstraction has 85 states and 100 transitions. [2019-01-14 02:48:28,250 INFO L609 BuchiCegarLoop]: Abstraction has 85 states and 100 transitions. [2019-01-14 02:48:28,250 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 02:48:28,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 100 transitions. [2019-01-14 02:48:28,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:48:28,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:28,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:28,254 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:28,254 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:48:28,257 INFO L794 eck$LassoCheckResult]: Stem: 2217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2211#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; 2206#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 2207#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; 2208#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2209#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; 2210#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; 2230#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2229#L33-3 assume !(main_~i~0 < main_~n~0); 2195#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 2194#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2196#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; 2224#L15-6 #t~short4 := ~j~0 > 0; 2231#L15-1 assume !#t~short4; 2220#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 2218#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2198#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 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; 2270#L15-6 #t~short4 := ~j~0 > 0; 2204#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; 2219#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2203#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2216#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2271#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; 2272#L15-6 #t~short4 := ~j~0 > 0; 2200#L15-1 [2019-01-14 02:48:28,257 INFO L796 eck$LassoCheckResult]: Loop: 2200#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; 2202#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; 2226#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 2213#L15-6 #t~short4 := ~j~0 > 0; 2200#L15-1 [2019-01-14 02:48:28,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:28,257 INFO L82 PathProgramCache]: Analyzing trace with hash 496161610, now seen corresponding path program 3 times [2019-01-14 02:48:28,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:28,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:28,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:28,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:28,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:28,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:28,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 1 times [2019-01-14 02:48:28,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:28,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:28,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:28,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:28,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:28,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:28,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1509363707, now seen corresponding path program 7 times [2019-01-14 02:48:28,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:28,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:28,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:28,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:28,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:28,564 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-01-14 02:48:28,863 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-01-14 02:48:29,169 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-01-14 02:48:29,351 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-14 02:48:29,544 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-14 02:48:29,841 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2019-01-14 02:48:30,344 WARN L181 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-01-14 02:48:30,896 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 108 [2019-01-14 02:48:30,995 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:30,995 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:30,995 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:30,995 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:30,995 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:30,995 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:30,995 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:30,996 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:30,996 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration12_Lasso [2019-01-14 02:48:30,996 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:30,996 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:31,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,211 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-01-14 02:48:31,363 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-01-14 02:48:31,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:31,801 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-14 02:48:31,858 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:31,858 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:31,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:31,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:31,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:31,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:31,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:31,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:31,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:31,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:31,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:31,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:31,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:31,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:31,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:31,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:31,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:31,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:31,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:31,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:31,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:31,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:31,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:31,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:31,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:31,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:31,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:31,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:31,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:31,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:31,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:31,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:31,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:31,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:31,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:31,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:31,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:31,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:31,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:31,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:31,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:31,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:31,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:31,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:31,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:31,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:31,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:31,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:31,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:31,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:31,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:31,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:31,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:31,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:31,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:31,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:31,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:31,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:31,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:31,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:31,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:31,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:31,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:31,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:31,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:31,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:31,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:31,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:31,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:31,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:31,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:31,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:31,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:31,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:31,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:31,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:31,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:31,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:31,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:31,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:31,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:31,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:31,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:31,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:31,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:31,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:31,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:31,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:31,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:31,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:31,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:31,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:31,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:31,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:31,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:31,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:31,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:31,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:31,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:31,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:31,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:31,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:31,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:31,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:31,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:31,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:31,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:31,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:31,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:31,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:31,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:31,929 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:48:31,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:31,938 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 02:48:31,938 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:48:32,003 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:32,043 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:48:32,043 INFO L444 ModelExtractionUtils]: 49 out of 56 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:48:32,043 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:32,044 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-14 02:48:32,044 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:32,045 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 [] [2019-01-14 02:48:32,214 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-01-14 02:48:32,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:32,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:32,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:32,333 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:48:32,334 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2019-01-14 02:48:32,343 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. [2019-01-14 02:48:32,344 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 [2019-01-14 02:48:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:48:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-14 02:48:32,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 02:48:32,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:32,346 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:48:32,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:32,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:32,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:32,489 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:48:32,490 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2019-01-14 02:48:32,502 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. [2019-01-14 02:48:32,503 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 [2019-01-14 02:48:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:48:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-14 02:48:32,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 02:48:32,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:32,505 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:48:32,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:32,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:32,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:32,590 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:48:32,591 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2019-01-14 02:48:32,621 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. [2019-01-14 02:48:32,622 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 [2019-01-14 02:48:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:48:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-01-14 02:48:32,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 02:48:32,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:32,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 32 letters. Loop has 4 letters. [2019-01-14 02:48:32,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:32,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 8 letters. [2019-01-14 02:48:32,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:32,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 157 transitions. [2019-01-14 02:48:32,629 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:48:32,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 0 states and 0 transitions. [2019-01-14 02:48:32,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:48:32,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:48:32,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:48:32,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:32,636 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:32,636 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:32,636 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:32,636 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 02:48:32,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:48:32,636 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:48:32,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:48:32,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:48:32 BoogieIcfgContainer [2019-01-14 02:48:32,643 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:48:32,643 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:48:32,643 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:48:32,644 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:48:32,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:48:03" (3/4) ... [2019-01-14 02:48:32,648 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:48:32,648 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:48:32,648 INFO L168 Benchmark]: Toolchain (without parser) took 30122.92 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 429.9 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -98.6 MB). Peak memory consumption was 331.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:32,650 INFO L168 Benchmark]: CDTParser took 0.21 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. [2019-01-14 02:48:32,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.48 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:32,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.31 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:32,651 INFO L168 Benchmark]: Boogie Preprocessor took 45.50 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:32,652 INFO L168 Benchmark]: RCFGBuilder took 552.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:32,653 INFO L168 Benchmark]: BuchiAutomizer took 29178.71 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 278.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.2 MB). Peak memory consumption was 358.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:32,654 INFO L168 Benchmark]: Witness Printer took 4.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:32,662 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.21 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 281.48 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 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 56.31 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.50 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 552.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29178.71 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 278.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.2 MB). Peak memory consumption was 358.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 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 * 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 7 locations. One deterministic module has affine ranking function size + -1 * i 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.1s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 23.5s. Construction of modules took 1.0s. Büchi inclusion checks took 4.2s. 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: 183 SDtfs, 263 SDslu, 424 SDs, 0 SdLazy, 713 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU1 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital244 mio100 ax100 hnf99 lsp93 ukn81 mio100 lsp57 div100 bol101 ite100 ukn100 eq168 hnf88 smp95 dnf122 smp92 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 118ms 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...