./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8104a25549f6efe413528ca8cc098e1acad610e4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:01:51,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:01:51,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:01:51,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:01:51,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:01:51,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:01:51,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:01:51,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:01:51,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:01:51,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:01:51,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:01:51,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:01:51,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:01:51,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:01:51,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:01:51,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:01:51,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:01:51,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:01:51,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:01:51,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:01:51,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:01:51,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:01:51,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:01:51,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:01:51,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:01:51,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:01:51,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:01:51,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:01:51,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:01:51,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:01:51,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:01:51,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:01:51,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:01:51,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:01:51,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:01:51,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:01:51,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:01:51,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:01:51,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:01:51,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:01:51,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:01:51,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:01:51,730 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:01:51,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:01:51,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:01:51,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:01:51,733 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:01:51,733 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:01:51,734 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:01:51,734 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:01:51,734 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:01:51,734 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:01:51,735 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:01:51,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:01:51,735 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:01:51,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:01:51,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:01:51,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:01:51,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:01:51,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:01:51,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:01:51,740 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:01:51,740 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:01:51,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:01:51,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:01:51,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:01:51,741 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:01:51,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:01:51,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:01:51,742 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:01:51,743 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:01:51,743 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8104a25549f6efe413528ca8cc098e1acad610e4 [2019-11-28 03:01:52,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:01:52,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:01:52,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:01:52,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:01:52,069 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:01:52,070 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2019-11-28 03:01:52,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/292e67304/492f2f324ba74c468327e7f2c86af1b3/FLAGfd551f8a4 [2019-11-28 03:01:52,712 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:01:52,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2019-11-28 03:01:52,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/292e67304/492f2f324ba74c468327e7f2c86af1b3/FLAGfd551f8a4 [2019-11-28 03:01:52,991 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/292e67304/492f2f324ba74c468327e7f2c86af1b3 [2019-11-28 03:01:52,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:01:52,999 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:01:53,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:01:53,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:01:53,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:01:53,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:52" (1/1) ... [2019-11-28 03:01:53,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ea3f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:53, skipping insertion in model container [2019-11-28 03:01:53,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:52" (1/1) ... [2019-11-28 03:01:53,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:01:53,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:01:53,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:01:53,507 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:01:53,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:01:53,611 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:01:53,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:53 WrapperNode [2019-11-28 03:01:53,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:01:53,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:01:53,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:01:53,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:01:53,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:53" (1/1) ... [2019-11-28 03:01:53,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:53" (1/1) ... [2019-11-28 03:01:53,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:01:53,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:01:53,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:01:53,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:01:53,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:53" (1/1) ... [2019-11-28 03:01:53,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:53" (1/1) ... [2019-11-28 03:01:53,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:53" (1/1) ... [2019-11-28 03:01:53,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:53" (1/1) ... [2019-11-28 03:01:53,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:53" (1/1) ... [2019-11-28 03:01:53,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:53" (1/1) ... [2019-11-28 03:01:53,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:53" (1/1) ... [2019-11-28 03:01:53,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:01:53,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:01:53,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:01:53,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:01:53,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:53" (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-11-28 03:01:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:01:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:01:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:01:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:01:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:01:53,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:01:54,077 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:01:54,078 INFO L297 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 03:01:54,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:54 BoogieIcfgContainer [2019-11-28 03:01:54,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:01:54,080 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:01:54,080 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:01:54,084 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:01:54,085 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:01:54,086 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:01:52" (1/3) ... [2019-11-28 03:01:54,087 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@668b1187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:01:54, skipping insertion in model container [2019-11-28 03:01:54,087 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:01:54,087 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:53" (2/3) ... [2019-11-28 03:01:54,088 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@668b1187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:01:54, skipping insertion in model container [2019-11-28 03:01:54,088 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:01:54,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:54" (3/3) ... [2019-11-28 03:01:54,090 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-2.i [2019-11-28 03:01:54,143 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:01:54,143 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:01:54,144 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:01:54,144 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:01:54,144 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:01:54,144 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:01:54,144 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:01:54,144 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:01:54,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 03:01:54,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:01:54,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:01:54,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:01:54,184 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:01:54,184 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:01:54,184 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:01:54,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 03:01:54,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:01:54,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:01:54,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:01:54,187 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:01:54,187 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:01:54,193 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 16#L560true assume !(main_~array_size~0 < 1); 5#L560-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 6#L550-3true [2019-11-28 03:01:54,194 INFO L796 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 8#L553-6true assume !true; 9#L553-7true call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 3#L550-2true insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 6#L550-3true [2019-11-28 03:01:54,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:54,201 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-28 03:01:54,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:54,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386810005] [2019-11-28 03:01:54,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:54,328 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:54,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:54,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2019-11-28 03:01:54,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:54,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619952275] [2019-11-28 03:01:54,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:01:54,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619952275] [2019-11-28 03:01:54,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:01:54,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:01:54,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998935463] [2019-11-28 03:01:54,383 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:01:54,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:01:54,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 03:01:54,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 03:01:54,404 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-11-28 03:01:54,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:01:54,413 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-11-28 03:01:54,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:01:54,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-11-28 03:01:54,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:01:54,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2019-11-28 03:01:54,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:01:54,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:01:54,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-28 03:01:54,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:01:54,426 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 03:01:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-28 03:01:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-28 03:01:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 03:01:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-28 03:01:54,449 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 03:01:54,449 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 03:01:54,450 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:01:54,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-28 03:01:54,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:01:54,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:01:54,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:01:54,453 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:01:54,453 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:01:54,453 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 42#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 43#L560 assume !(main_~array_size~0 < 1); 44#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 41#L550-3 [2019-11-28 03:01:54,454 INFO L796 eck$LassoCheckResult]: Loop: 41#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 39#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 46#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 47#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 48#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 40#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 41#L550-3 [2019-11-28 03:01:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:54,454 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-28 03:01:54,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:54,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277425310] [2019-11-28 03:01:54,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:54,498 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:54,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2019-11-28 03:01:54,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:54,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016268447] [2019-11-28 03:01:54,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:54,555 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:54,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:54,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2019-11-28 03:01:54,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:54,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818437285] [2019-11-28 03:01:54,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:54,613 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:54,790 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-11-28 03:01:54,980 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-28 03:01:55,051 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:01:55,052 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:01:55,052 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:01:55,052 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:01:55,052 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:01:55,053 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,053 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:01:55,053 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:01:55,053 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration2_Lasso [2019-11-28 03:01:55,054 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:01:55,054 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:01:55,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,264 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-28 03:01:55,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,751 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:01:55,756 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,763 INFO L120 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-11-28 03:01:55,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,796 INFO L120 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-11-28 03:01:55,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:55,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,816 INFO L120 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-11-28 03:01:55,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:55,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,833 INFO L120 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-11-28 03:01:55,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:55,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,847 INFO L120 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-11-28 03:01:55,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:55,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,880 INFO L120 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-11-28 03:01:55,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:55,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,902 INFO L120 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-11-28 03:01:55,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,925 INFO L120 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-11-28 03:01:55,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,954 INFO L120 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-11-28 03:01:55,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:55,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,973 INFO L120 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-11-28 03:01:55,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:55,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:56,003 INFO L120 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-11-28 03:01:56,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:56,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:56,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:56,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:56,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:56,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:56,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:56,033 INFO L120 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-11-28 03:01:56,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:56,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:56,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:56,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:56,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:56,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:56,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:56,067 INFO L120 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-11-28 03:01:56,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:56,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:56,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:56,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:56,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:56,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:56,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:56,085 INFO L120 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-11-28 03:01:56,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:56,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:56,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:56,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:56,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:56,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:56,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:56,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:56,108 INFO L120 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-11-28 03:01:56,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:56,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:56,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:56,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:56,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:56,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:56,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:56,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:56,123 INFO L120 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-11-28 03:01:56,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:56,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:56,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:56,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:56,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:56,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:56,167 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:01:56,359 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-28 03:01:56,359 INFO L444 ModelExtractionUtils]: 11 out of 37 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:56,399 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:56,428 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:01:56,429 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:01:56,430 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_insertionSort_~i~0, v_rep(select #length ULTIMATE.start_insertionSort_~a.base)_1) = -1*ULTIMATE.start_insertionSort_~a.offset - 4*ULTIMATE.start_insertionSort_~i~0 + 1*v_rep(select #length ULTIMATE.start_insertionSort_~a.base)_1 Supporting invariants [] [2019-11-28 03:01:56,457 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:01:56,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:01:56,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:56,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:01:56,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:56,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:01:56,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:01:56,560 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-11-28 03:01:56,561 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-28 03:01:56,609 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2019-11-28 03:01:56,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:01:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:01:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-28 03:01:56,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 03:01:56,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:56,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 03:01:56,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:56,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 03:01:56,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:56,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2019-11-28 03:01:56,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:01:56,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 23 transitions. [2019-11-28 03:01:56,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 03:01:56,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 03:01:56,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-11-28 03:01:56,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:01:56,620 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 03:01:56,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-11-28 03:01:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-28 03:01:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 03:01:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-28 03:01:56,623 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 03:01:56,623 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 03:01:56,623 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:01:56,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-28 03:01:56,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:01:56,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:01:56,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:01:56,625 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:01:56,625 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:01:56,625 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 140#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 141#L560 assume !(main_~array_size~0 < 1); 142#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 143#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 135#L553-6 [2019-11-28 03:01:56,626 INFO L796 eck$LassoCheckResult]: Loop: 135#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 144#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 147#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 134#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 135#L553-6 [2019-11-28 03:01:56,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:56,626 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-28 03:01:56,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:56,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805803530] [2019-11-28 03:01:56,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:56,666 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:56,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:56,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 1 times [2019-11-28 03:01:56,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:56,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376351136] [2019-11-28 03:01:56,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:56,696 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:56,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:56,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1185710257, now seen corresponding path program 1 times [2019-11-28 03:01:56,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:56,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883419294] [2019-11-28 03:01:56,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:56,730 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:56,956 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-11-28 03:01:57,006 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:01:57,006 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:01:57,006 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:01:57,007 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:01:57,007 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:01:57,007 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:57,007 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:01:57,007 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:01:57,007 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration3_Lasso [2019-11-28 03:01:57,007 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:01:57,007 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:01:57,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,172 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-28 03:01:57,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,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-11-28 03:01:57,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-11-28 03:01:57,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-11-28 03:01:57,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-11-28 03:01:57,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-11-28 03:01:57,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,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-11-28 03:01:57,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-11-28 03:01:57,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-11-28 03:01:57,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,549 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:01:57,549 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:57,566 INFO L120 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-11-28 03:01:57,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:57,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:57,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:57,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:57,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:57,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:57,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:57,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:57,597 INFO L120 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-11-28 03:01:57,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:57,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:57,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:57,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:57,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:57,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:57,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:57,633 INFO L120 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-11-28 03:01:57,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:57,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:57,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:57,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:57,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:57,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:57,663 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:01:57,709 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-28 03:01:57,709 INFO L444 ModelExtractionUtils]: 23 out of 37 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:57,720 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:01:57,723 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:01:57,723 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:01:57,723 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2019-11-28 03:01:57,739 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:01:57,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:57,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:01:57,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:57,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:01:57,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:01:57,857 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-11-28 03:01:57,857 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-28 03:01:57,931 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 47 states and 62 transitions. Complement of second has 9 states. [2019-11-28 03:01:57,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:01:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:01:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-28 03:01:57,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 03:01:57,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:57,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-28 03:01:57,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:57,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-28 03:01:57,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:57,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2019-11-28 03:01:57,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:01:57,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 30 states and 40 transitions. [2019-11-28 03:01:57,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 03:01:57,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 03:01:57,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-28 03:01:57,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:01:57,956 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-28 03:01:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-28 03:01:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-11-28 03:01:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 03:01:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-11-28 03:01:57,964 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-28 03:01:57,965 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-28 03:01:57,965 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:01:57,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2019-11-28 03:01:57,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:01:57,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:01:57,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:01:57,969 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:01:57,970 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:01:57,971 INFO L794 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 274#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 275#L560 assume !(main_~array_size~0 < 1); 276#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 277#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 271#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 283#L553-1 assume !insertionSort_#t~short6; 284#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 285#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 272#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 273#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 269#L553-6 [2019-11-28 03:01:57,971 INFO L796 eck$LassoCheckResult]: Loop: 269#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 278#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 282#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 268#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 269#L553-6 [2019-11-28 03:01:57,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:57,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2019-11-28 03:01:57,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:57,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054806408] [2019-11-28 03:01:57,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:01:58,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054806408] [2019-11-28 03:01:58,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:01:58,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:01:58,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324214792] [2019-11-28 03:01:58,052 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:01:58,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:58,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2019-11-28 03:01:58,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:58,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187973093] [2019-11-28 03:01:58,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:58,066 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:58,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:01:58,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:01:58,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:01:58,161 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-28 03:01:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:01:58,228 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-11-28 03:01:58,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:01:58,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-11-28 03:01:58,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:01:58,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2019-11-28 03:01:58,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 03:01:58,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 03:01:58,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2019-11-28 03:01:58,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:01:58,232 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 03:01:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2019-11-28 03:01:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2019-11-28 03:01:58,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 03:01:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-11-28 03:01:58,235 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 03:01:58,236 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 03:01:58,236 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:01:58,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-11-28 03:01:58,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:01:58,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:01:58,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:01:58,238 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:01:58,238 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:01:58,238 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 341#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 342#L560 assume !(main_~array_size~0 < 1); 343#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 344#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 346#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 347#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 352#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 353#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 339#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 340#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 336#L553-6 [2019-11-28 03:01:58,238 INFO L796 eck$LassoCheckResult]: Loop: 336#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 345#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 351#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 335#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 336#L553-6 [2019-11-28 03:01:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:58,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1301169056, now seen corresponding path program 2 times [2019-11-28 03:01:58,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:58,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579321263] [2019-11-28 03:01:58,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:58,274 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:58,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:58,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 3 times [2019-11-28 03:01:58,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:58,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452239636] [2019-11-28 03:01:58,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:58,289 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:58,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1886560891, now seen corresponding path program 1 times [2019-11-28 03:01:58,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:58,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275021097] [2019-11-28 03:01:58,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:58,366 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:58,773 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 89 [2019-11-28 03:01:58,863 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:01:58,864 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:01:58,864 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:01:58,864 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:01:58,864 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:01:58,864 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:58,865 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:01:58,865 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:01:58,865 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration5_Lasso [2019-11-28 03:01:58,865 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:01:58,865 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:01:58,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:59,068 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-11-28 03:01:59,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:59,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:59,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:59,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:59,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:59,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:59,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:59,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:59,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:59,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:59,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:59,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:59,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:59,555 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:01:59,555 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:59,567 INFO L120 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-11-28 03:01:59,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:59,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:59,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:59,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:59,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:59,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:59,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:59,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:59,582 INFO L120 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-11-28 03:01:59,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:59,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:59,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:59,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:59,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:59,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:59,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:59,607 INFO L120 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-11-28 03:01:59,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:59,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:59,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:59,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:59,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:59,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:59,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:59,627 INFO L120 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-11-28 03:01:59,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:59,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:59,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:59,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:59,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:59,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:59,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:59,648 INFO L120 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-11-28 03:01:59,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:59,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:59,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:59,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:59,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:59,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:59,677 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:01:59,731 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2019-11-28 03:01:59,732 INFO L444 ModelExtractionUtils]: 10 out of 37 variables were initially zero. Simplification set additionally 25 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:59,737 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:59,740 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:01:59,740 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:01:59,740 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2019-11-28 03:01:59,771 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-28 03:01:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:59,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:01:59,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:59,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:01:59,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:01:59,849 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-11-28 03:01:59,849 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 03:01:59,897 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2019-11-28 03:01:59,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:01:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:01:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-28 03:01:59,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-28 03:01:59,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:59,899 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:01:59,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:59,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:01:59,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:59,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:01:59,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:01:59,970 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-11-28 03:01:59,971 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 03:02:00,009 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2019-11-28 03:02:00,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:02:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:02:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-28 03:02:00,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-28 03:02:00,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:00,011 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:02:00,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:00,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:02:00,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:00,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:02:00,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:00,074 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-11-28 03:02:00,074 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 03:02:00,121 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 56 states and 75 transitions. Complement of second has 8 states. [2019-11-28 03:02:00,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:02:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:02:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-28 03:02:00,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-28 03:02:00,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:00,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 03:02:00,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:00,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 8 letters. [2019-11-28 03:02:00,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:00,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 75 transitions. [2019-11-28 03:02:00,126 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:02:00,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 0 states and 0 transitions. [2019-11-28 03:02:00,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:02:00,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:02:00,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:02:00,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:02:00,127 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:02:00,127 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:02:00,127 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:02:00,127 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:02:00,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:02:00,127 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:02:00,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:02:00,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:02:00 BoogieIcfgContainer [2019-11-28 03:02:00,137 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:02:00,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:02:00,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:02:00,138 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:02:00,138 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:54" (3/4) ... [2019-11-28 03:02:00,142 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:02:00,142 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:02:00,144 INFO L168 Benchmark]: Toolchain (without parser) took 7146.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 959.0 MB in the beginning and 1.2 GB in the end (delta: -227.5 MB). Peak memory consumption was 97.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:00,145 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:02:00,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:00,152 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:00,152 INFO L168 Benchmark]: Boogie Preprocessor took 25.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:02:00,154 INFO L168 Benchmark]: RCFGBuilder took 398.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:00,160 INFO L168 Benchmark]: BuchiAutomizer took 6056.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -93.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:00,161 INFO L168 Benchmark]: Witness Printer took 4.51 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:02:00,169 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 610.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 398.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6056.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -93.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.51 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * a + -4 * i + unknown-#length-unknown[a] and consists of 3 locations. One deterministic module has affine ranking function j and consists of 5 locations. One nondeterministic module has affine ranking function j and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 79 SDtfs, 116 SDslu, 40 SDs, 0 SdLazy, 136 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital165 mio100 ax110 hnf99 lsp86 ukn77 mio100 lsp64 div100 bol100 ite100 ukn100 eq180 hnf82 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...