./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c 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-recursive-malloc/selectionSort_recursive.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 6ac1507c93933134ec25f982abf479335179fe0d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:37:28,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:37:28,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:37:28,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:37:28,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:37:28,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:37:28,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:37:28,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:37:28,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:37:28,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:37:28,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:37:28,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:37:28,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:37:28,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:37:28,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:37:28,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:37:28,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:37:28,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:37:28,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:37:28,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:37:28,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:37:28,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:37:28,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:37:28,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:37:28,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:37:28,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:37:28,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:37:28,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:37:28,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:37:28,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:37:28,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:37:28,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:37:28,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:37:28,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:37:28,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:37:28,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:37:28,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:37:28,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:37:28,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:37:28,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:37:28,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:37:28,119 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:37:28,140 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:37:28,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:37:28,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:37:28,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:37:28,148 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:37:28,148 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:37:28,149 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:37:28,149 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:37:28,149 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:37:28,149 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:37:28,151 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:37:28,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:37:28,151 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:37:28,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:37:28,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:37:28,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:37:28,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:37:28,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:37:28,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:37:28,153 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:37:28,154 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:37:28,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:37:28,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:37:28,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:37:28,155 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:37:28,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:37:28,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:37:28,156 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:37:28,156 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:37:28,157 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:37:28,157 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 -> 6ac1507c93933134ec25f982abf479335179fe0d [2019-11-28 20:37:28,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:37:28,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:37:28,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:37:28,486 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:37:28,488 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:37:28,489 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2019-11-28 20:37:28,562 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d195e504/f03b60e06d144bf3990acfb09a87bae4/FLAG75b2badc0 [2019-11-28 20:37:29,077 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:37:29,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2019-11-28 20:37:29,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d195e504/f03b60e06d144bf3990acfb09a87bae4/FLAG75b2badc0 [2019-11-28 20:37:29,462 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d195e504/f03b60e06d144bf3990acfb09a87bae4 [2019-11-28 20:37:29,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:37:29,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:37:29,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:37:29,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:37:29,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:37:29,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:37:29" (1/1) ... [2019-11-28 20:37:29,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8461f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:29, skipping insertion in model container [2019-11-28 20:37:29,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:37:29" (1/1) ... [2019-11-28 20:37:29,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:37:29,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:37:29,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:37:29,701 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:37:29,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:37:29,733 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:37:29,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:29 WrapperNode [2019-11-28 20:37:29,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:37:29,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:37:29,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:37:29,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:37:29,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:29" (1/1) ... [2019-11-28 20:37:29,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:29" (1/1) ... [2019-11-28 20:37:29,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:37:29,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:37:29,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:37:29,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:37:29,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:29" (1/1) ... [2019-11-28 20:37:29,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:29" (1/1) ... [2019-11-28 20:37:29,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:29" (1/1) ... [2019-11-28 20:37:29,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:29" (1/1) ... [2019-11-28 20:37:29,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:29" (1/1) ... [2019-11-28 20:37:29,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:29" (1/1) ... [2019-11-28 20:37:29,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:29" (1/1) ... [2019-11-28 20:37:29,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:37:29,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:37:29,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:37:29,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:37:29,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:29" (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 20:37:29,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:37:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:37:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:37:29,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:37:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:37:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2019-11-28 20:37:29,907 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2019-11-28 20:37:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:37:30,190 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:37:30,190 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 20:37:30,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:30 BoogieIcfgContainer [2019-11-28 20:37:30,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:37:30,193 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:37:30,194 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:37:30,197 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:37:30,199 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:37:30,199 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:37:29" (1/3) ... [2019-11-28 20:37:30,201 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ac0e987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:37:30, skipping insertion in model container [2019-11-28 20:37:30,201 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:37:30,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:29" (2/3) ... [2019-11-28 20:37:30,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ac0e987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:37:30, skipping insertion in model container [2019-11-28 20:37:30,202 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:37:30,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:30" (3/3) ... [2019-11-28 20:37:30,204 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive.i [2019-11-28 20:37:30,263 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:37:30,264 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:37:30,264 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:37:30,264 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:37:30,264 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:37:30,264 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:37:30,264 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:37:30,265 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:37:30,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-11-28 20:37:30,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 20:37:30,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:30,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:30,322 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:37:30,322 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:37:30,322 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:37:30,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-11-28 20:37:30,325 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 20:37:30,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:30,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:30,326 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:37:30,326 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:37:30,334 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 9#L31true assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 16#L36-3true [2019-11-28 20:37:30,334 INFO L796 eck$LassoCheckResult]: Loop: 16#L36-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 20#L36-2true main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 16#L36-3true [2019-11-28 20:37:30,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:30,340 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-28 20:37:30,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:30,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821830112] [2019-11-28 20:37:30,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:30,488 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:30,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:30,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2019-11-28 20:37:30,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:30,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068751109] [2019-11-28 20:37:30,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:30,512 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:30,514 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2019-11-28 20:37:30,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:30,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595888479] [2019-11-28 20:37:30,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:30,556 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:30,823 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:37:30,824 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:37:30,824 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:37:30,825 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:37:30,825 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:37:30,825 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:30,825 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:37:30,826 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:37:30,826 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration1_Lasso [2019-11-28 20:37:30,826 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:37:30,826 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:37:30,860 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 20:37:30,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 20:37:30,873 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 20:37:30,879 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 20:37:31,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:37:31,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:37:31,325 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:37:31,331 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:31,344 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 20:37:31,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:31,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:31,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:31,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:31,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:31,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:31,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:31,369 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 20:37:31,381 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 20:37:31,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:31,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:31,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:31,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:31,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:31,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:31,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:31,387 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) [2019-11-28 20:37:31,399 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 20:37:31,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:31,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:31,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:31,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:31,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:31,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:31,415 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) [2019-11-28 20:37:31,428 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 20:37:31,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:31,430 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 20:37:31,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:31,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:31,437 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 20:37:31,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:31,447 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 20:37:31,462 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 20:37:31,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:31,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:31,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:31,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:31,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:31,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:31,478 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 20:37:31,491 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 20:37:31,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:31,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:31,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:31,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:31,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:31,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:31,542 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:37:31,595 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 20:37:31,596 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. 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 20:37:31,606 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:31,610 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:37:31,611 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:37:31,612 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~a~0.base)_1) = -2*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~a~0.base)_1 Supporting invariants [-2*ULTIMATE.start_main_~n~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_1 >= 0] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 20:37:31,636 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 20:37:31,656 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:37:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:31,719 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:37:31,721 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:31,737 WARN L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:37:31,738 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:31,762 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 20:37:31,781 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 20:37:31,782 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2019-11-28 20:37:31,887 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 39 states and 53 transitions. Complement of second has 9 states. [2019-11-28 20:37:31,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:37:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:37:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2019-11-28 20:37:31,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 20:37:31,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:31,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 20:37:31,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:31,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-28 20:37:31,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:31,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2019-11-28 20:37:31,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:37:31,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 19 transitions. [2019-11-28 20:37:31,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:37:31,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 20:37:31,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-28 20:37:31,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:37:31,924 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 20:37:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-28 20:37:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 20:37:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 20:37:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-28 20:37:31,962 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 20:37:31,962 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 20:37:31,962 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:37:31,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-28 20:37:31,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:37:31,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:31,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:31,966 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:37:31,966 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:37:31,966 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 129#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 130#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 131#L36-3 assume !(main_~i~0 < main_~n~0); 124#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 127#selectionSortENTRY [2019-11-28 20:37:31,967 INFO L796 eck$LassoCheckResult]: Loop: 127#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 128#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 132#L14-3 assume !(~index~0 < ~size); 133#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 125#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 127#selectionSortENTRY [2019-11-28 20:37:31,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:31,968 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 1 times [2019-11-28 20:37:31,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:31,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735509314] [2019-11-28 20:37:31,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:32,061 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 20:37:32,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735509314] [2019-11-28 20:37:32,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:37:32,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:37:32,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449771912] [2019-11-28 20:37:32,066 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:37:32,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:32,067 INFO L82 PathProgramCache]: Analyzing trace with hash 53570596, now seen corresponding path program 1 times [2019-11-28 20:37:32,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:32,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418837605] [2019-11-28 20:37:32,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:32,088 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 20:37:32,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418837605] [2019-11-28 20:37:32,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:37:32,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:37:32,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583171520] [2019-11-28 20:37:32,090 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:37:32,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:37:32,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:37:32,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:37:32,095 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 20:37:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:37:32,120 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-11-28 20:37:32,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:37:32,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-11-28 20:37:32,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:37:32,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-11-28 20:37:32,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 20:37:32,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:37:32,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-28 20:37:32,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:37:32,125 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 20:37:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-28 20:37:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-28 20:37:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 20:37:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-28 20:37:32,128 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 20:37:32,128 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 20:37:32,129 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:37:32,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-28 20:37:32,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:37:32,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:32,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:32,131 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:37:32,131 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:37:32,131 INFO L794 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 165#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 166#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 167#L36-3 assume !(main_~i~0 < main_~n~0); 160#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 163#selectionSortENTRY [2019-11-28 20:37:32,131 INFO L796 eck$LassoCheckResult]: Loop: 163#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 164#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 168#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 159#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 162#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 171#L14-3 assume !(~index~0 < ~size); 169#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 161#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 163#selectionSortENTRY [2019-11-28 20:37:32,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:32,132 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 2 times [2019-11-28 20:37:32,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:32,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755612171] [2019-11-28 20:37:32,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:32,155 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 20:37:32,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755612171] [2019-11-28 20:37:32,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:37:32,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:37:32,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59778040] [2019-11-28 20:37:32,156 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:37:32,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:32,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 1 times [2019-11-28 20:37:32,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:32,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486991376] [2019-11-28 20:37:32,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:32,192 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:32,412 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-11-28 20:37:32,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:37:32,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:37:32,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:37:32,611 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 20:37:32,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:37:32,624 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-11-28 20:37:32,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:37:32,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2019-11-28 20:37:32,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:37:32,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2019-11-28 20:37:32,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 20:37:32,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:37:32,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-11-28 20:37:32,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:37:32,627 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-28 20:37:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-11-28 20:37:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-28 20:37:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 20:37:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-28 20:37:32,630 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-28 20:37:32,631 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-28 20:37:32,631 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:37:32,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-11-28 20:37:32,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:37:32,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:32,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:32,633 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:37:32,633 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:37:32,633 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 202#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 203#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 204#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 209#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 210#L36-3 assume !(main_~i~0 < main_~n~0); 197#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 200#selectionSortENTRY [2019-11-28 20:37:32,634 INFO L796 eck$LassoCheckResult]: Loop: 200#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 201#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 205#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 196#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 199#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 208#L14-3 assume !(~index~0 < ~size); 206#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 198#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 200#selectionSortENTRY [2019-11-28 20:37:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996941, now seen corresponding path program 1 times [2019-11-28 20:37:32,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:32,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536335552] [2019-11-28 20:37:32,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:32,660 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:32,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:32,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 2 times [2019-11-28 20:37:32,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:32,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535328117] [2019-11-28 20:37:32,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:32,706 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:32,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:32,707 INFO L82 PathProgramCache]: Analyzing trace with hash 170190416, now seen corresponding path program 1 times [2019-11-28 20:37:32,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:32,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409127955] [2019-11-28 20:37:32,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:37:32,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409127955] [2019-11-28 20:37:32,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416365909] [2019-11-28 20:37:32,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:37:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:32,879 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:37:32,881 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:37:32,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:37:32,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-28 20:37:32,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597222355] [2019-11-28 20:37:33,199 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-11-28 20:37:33,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:37:33,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:37:33,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:37:33,384 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2019-11-28 20:37:33,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:37:33,454 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-11-28 20:37:33,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:37:33,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2019-11-28 20:37:33,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:37:33,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 21 transitions. [2019-11-28 20:37:33,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 20:37:33,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:37:33,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-28 20:37:33,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:37:33,458 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-28 20:37:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-28 20:37:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 20:37:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 20:37:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-28 20:37:33,460 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 20:37:33,460 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 20:37:33,460 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:37:33,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-28 20:37:33,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:37:33,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:33,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:33,462 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-28 20:37:33,462 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:37:33,463 INFO L794 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 299#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 300#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 301#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 306#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 307#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 308#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 309#L36-3 assume !(main_~i~0 < main_~n~0); 295#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 297#selectionSortENTRY [2019-11-28 20:37:33,463 INFO L796 eck$LassoCheckResult]: Loop: 297#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 298#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 302#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 293#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 296#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 305#L14-3 assume !(~index~0 < ~size); 303#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 294#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 297#selectionSortENTRY [2019-11-28 20:37:33,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:33,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1357299119, now seen corresponding path program 2 times [2019-11-28 20:37:33,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:33,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261600512] [2019-11-28 20:37:33,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:33,486 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:33,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:33,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 3 times [2019-11-28 20:37:33,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:33,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475393912] [2019-11-28 20:37:33,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:33,531 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:33,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash -290845646, now seen corresponding path program 2 times [2019-11-28 20:37:33,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:33,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323611605] [2019-11-28 20:37:33,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:33,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:33,809 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-11-28 20:37:34,187 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-11-28 20:37:34,372 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:37:34,372 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:37:34,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:37:34,373 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:37:34,373 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:37:34,373 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:34,373 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:37:34,373 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:37:34,373 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration5_Lasso [2019-11-28 20:37:34,373 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:37:34,374 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:37:34,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:37:34,379 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 20:37:34,384 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 20:37:34,386 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 20:37:34,388 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 20:37:34,389 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 20:37:34,391 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 20:37:34,392 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 20:37:34,394 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 20:37:34,397 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 20:37:34,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:37:34,401 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 20:37:34,402 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 20:37:34,404 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 20:37:34,406 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 20:37:34,407 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 20:37:34,409 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 20:37:34,412 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 20:37:34,414 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 20:37:34,415 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 20:37:34,418 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 20:37:34,421 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 20:37:34,424 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 20:37:34,426 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 20:37:34,428 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 20:37:34,430 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 20:37:34,432 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 20:37:34,433 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 20:37:34,435 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 20:37:34,440 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 20:37:34,798 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:37:34,798 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:34,805 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 20:37:34,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:34,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:34,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:34,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:34,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:34,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:34,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:34,808 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 20:37:34,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 20:37:34,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:34,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:34,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:34,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:34,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:34,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:34,826 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) [2019-11-28 20:37:34,838 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 20:37:34,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:34,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:34,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:34,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:34,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:34,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:34,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:34,844 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) [2019-11-28 20:37:34,855 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 20:37:34,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:34,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:34,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:34,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:34,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:34,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:34,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:34,860 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) [2019-11-28 20:37:34,872 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 20:37:34,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:34,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:34,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:34,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:34,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:34,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:34,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:34,877 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 20:37:34,897 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 20:37:34,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:34,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:34,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:34,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:34,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:34,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:34,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:34,902 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:34,914 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 20:37:34,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:34,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:34,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:34,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:34,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:34,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:34,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:34,919 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) [2019-11-28 20:37:34,930 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 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:34,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:34,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:34,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:34,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:34,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:34,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:34,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:34,934 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 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:34,946 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 20:37:34,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:34,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:34,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:34,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:34,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:34,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:34,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:34,959 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:34,971 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 20:37:34,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:34,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:34,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:34,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:34,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:34,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:34,975 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 20:37:34,978 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 20:37:34,987 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 20:37:34,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:34,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:34,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:34,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:34,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:34,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:34,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:34,996 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,005 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 20:37:35,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:35,010 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 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 20:37:35,020 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 20:37:35,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:35,024 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:35,035 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 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:35,038 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 20:37:35,045 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 20:37:35,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:35,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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,060 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 20:37:35,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:35,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:35,068 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 20:37:35,079 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 20:37:35,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,082 INFO L402 nArgumentSynthesizer]: A total of 0 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 20:37:35,084 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 20:37:35,090 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 20:37:35,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,093 INFO L402 nArgumentSynthesizer]: A total of 0 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 20:37:35,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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:35,102 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 20:37:35,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,107 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:35,113 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 20:37:35,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,118 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:35,125 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 20:37:35,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,129 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:35,135 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 20:37:35,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,140 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:35,147 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 20:37:35,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,157 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:35,168 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 20:37:35,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,179 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:35,185 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 20:37:35,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,196 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:35,205 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 20:37:35,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,211 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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,217 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 20:37:35,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:35,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:35,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:35,222 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,229 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 20:37:35,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:35,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:35,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:35,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:35,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:35,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:35,251 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:37:35,290 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-11-28 20:37:35,290 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:35,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:37:35,297 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:37:35,297 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:37:35,297 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_#in~startIndex, selectionSort_#in~size) = -1*selectionSort_#in~startIndex + 1*selectionSort_#in~size Supporting invariants [] [2019-11-28 20:37:35,305 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-28 20:37:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:35,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:37:35,347 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:35,370 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:37:35,370 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:37:35,409 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 20:37:35,409 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-28 20:37:35,474 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 39 states and 48 transitions. Complement of second has 11 states. [2019-11-28 20:37:35,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:37:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:37:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-28 20:37:35,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2019-11-28 20:37:35,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:35,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 17 letters. Loop has 8 letters. [2019-11-28 20:37:35,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:35,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 16 letters. [2019-11-28 20:37:35,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:35,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2019-11-28 20:37:35,483 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:37:35,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 44 transitions. [2019-11-28 20:37:35,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 20:37:35,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 20:37:35,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-11-28 20:37:35,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:37:35,487 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-28 20:37:35,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-11-28 20:37:35,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2019-11-28 20:37:35,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 20:37:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-11-28 20:37:35,492 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-28 20:37:35,492 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-28 20:37:35,492 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:37:35,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-11-28 20:37:35,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:37:35,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:35,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:35,495 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:37:35,495 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:37:35,495 INFO L794 eck$LassoCheckResult]: Stem: 455#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 449#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 450#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 451#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 457#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 458#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 459#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 460#L36-3 assume !(main_~i~0 < main_~n~0); 440#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 445#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 446#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 452#L14-3 [2019-11-28 20:37:35,495 INFO L796 eck$LassoCheckResult]: Loop: 452#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 439#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 441#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 452#L14-3 [2019-11-28 20:37:35,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:35,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1305603789, now seen corresponding path program 1 times [2019-11-28 20:37:35,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:35,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756363713] [2019-11-28 20:37:35,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:35,528 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:35,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:35,529 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 1 times [2019-11-28 20:37:35,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:35,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183345546] [2019-11-28 20:37:35,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:35,548 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:35,548 INFO L82 PathProgramCache]: Analyzing trace with hash -18607689, now seen corresponding path program 1 times [2019-11-28 20:37:35,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:35,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782333661] [2019-11-28 20:37:35,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:35,595 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:35,879 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-11-28 20:37:36,164 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-11-28 20:37:36,224 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:37:36,225 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:37:36,225 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:37:36,225 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:37:36,225 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:37:36,225 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,225 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:37:36,226 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:37:36,226 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration6_Lasso [2019-11-28 20:37:36,226 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:37:36,226 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:37:36,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 20:37:36,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 20:37:36,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:37:36,254 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 20:37:36,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:37:36,258 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 20:37:36,261 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 20:37:36,263 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 20:37:36,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:37:36,385 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-28 20:37:36,474 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 20:37:36,477 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 20:37:36,481 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 20:37:36,482 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 20:37:36,484 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 20:37:36,485 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 20:37:36,487 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 20:37:36,490 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 20:37:36,492 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 20:37:36,494 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 20:37:36,495 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 20:37:36,496 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 20:37:36,868 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:37:36,869 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:36,878 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 20:37:36,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:36,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:36,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:36,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:36,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:36,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:36,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,883 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:36,889 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 20:37:36,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:36,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:36,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:36,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:36,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:36,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:36,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,894 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 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,901 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 20:37:36,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:36,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:36,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:36,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:36,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:36,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:36,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:36,905 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 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,912 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 20:37:36,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:36,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:36,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:36,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:36,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:36,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:36,919 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:36,924 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 20:37:36,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:36,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:36,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:36,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:36,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:36,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:36,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,933 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:36,939 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 20:37:36,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:36,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:36,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:36,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:36,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:36,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:36,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,943 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:36,952 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 20:37:36,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:36,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:36,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:36,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:36,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:36,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:36,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,955 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:36,964 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 20:37:36,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:36,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:36,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:36,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:36,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:36,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:36,970 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:36,978 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 20:37:36,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:36,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:36,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:36,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:36,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:36,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:37,009 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:37:37,046 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2019-11-28 20:37:37,047 INFO L444 ModelExtractionUtils]: 14 out of 34 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:37,051 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:37:37,053 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:37:37,053 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:37:37,053 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~size) = -1*selectionSort_~index~0 + 1*selectionSort_~size Supporting invariants [] [2019-11-28 20:37:37,065 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 20:37:37,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:37,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:37:37,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:37,105 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:37:37,106 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:37,114 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 20:37:37,115 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 20:37:37,115 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-28 20:37:37,136 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 53 transitions. Complement of second has 8 states. [2019-11-28 20:37:37,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:37:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:37:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-28 20:37:37,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-28 20:37:37,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:37,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 20:37:37,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:37,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-28 20:37:37,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:37,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2019-11-28 20:37:37,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:37:37,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 36 transitions. [2019-11-28 20:37:37,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:37:37,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:37:37,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-11-28 20:37:37,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:37:37,142 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-28 20:37:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-11-28 20:37:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-11-28 20:37:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 20:37:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-11-28 20:37:37,144 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-28 20:37:37,144 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-28 20:37:37,144 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:37:37,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-11-28 20:37:37,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:37:37,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:37,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:37,146 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:37:37,146 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:37:37,146 INFO L794 eck$LassoCheckResult]: Stem: 600#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 594#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 595#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 596#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 602#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 603#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 604#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 605#L36-3 assume !(main_~i~0 < main_~n~0); 589#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 590#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 591#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 598#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 587#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 588#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 601#L14-3 assume !(~index~0 < ~size); 599#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 585#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 592#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 593#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 597#L14-3 [2019-11-28 20:37:37,146 INFO L796 eck$LassoCheckResult]: Loop: 597#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 584#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 586#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 597#L14-3 [2019-11-28 20:37:37,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:37,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1445216632, now seen corresponding path program 1 times [2019-11-28 20:37:37,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:37,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499878125] [2019-11-28 20:37:37,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 20:37:37,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499878125] [2019-11-28 20:37:37,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647863788] [2019-11-28 20:37:37,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:37:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:37,234 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 20:37:37,235 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:37:37,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:37:37,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2019-11-28 20:37:37,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178997964] [2019-11-28 20:37:37,323 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:37:37,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:37,323 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 2 times [2019-11-28 20:37:37,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:37,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585723912] [2019-11-28 20:37:37,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:37,332 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:37,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:37:37,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 20:37:37,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:37:37,395 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 15 states. [2019-11-28 20:37:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:37:37,653 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2019-11-28 20:37:37,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 20:37:37,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 64 transitions. [2019-11-28 20:37:37,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:37:37,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 45 transitions. [2019-11-28 20:37:37,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 20:37:37,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 20:37:37,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-11-28 20:37:37,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:37:37,658 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-28 20:37:37,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-11-28 20:37:37,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-11-28 20:37:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:37:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-28 20:37:37,661 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-28 20:37:37,661 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-28 20:37:37,661 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:37:37,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2019-11-28 20:37:37,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:37:37,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:37:37,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:37:37,663 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:37:37,663 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:37:37,663 INFO L794 eck$LassoCheckResult]: Stem: 762#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 755#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 756#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 757#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 764#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 771#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 767#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 765#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 766#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 768#L36-3 assume !(main_~i~0 < main_~n~0); 749#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 751#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 752#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 760#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 770#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 763#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 759#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 748#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 750#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 769#L14-3 assume !(~index~0 < ~size); 761#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 746#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 753#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 754#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 758#L14-3 [2019-11-28 20:37:37,663 INFO L796 eck$LassoCheckResult]: Loop: 758#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 745#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 747#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 758#L14-3 [2019-11-28 20:37:37,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:37,663 INFO L82 PathProgramCache]: Analyzing trace with hash 349648920, now seen corresponding path program 2 times [2019-11-28 20:37:37,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:37,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605013835] [2019-11-28 20:37:37,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:37,704 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:37,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:37,704 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 3 times [2019-11-28 20:37:37,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:37,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064981186] [2019-11-28 20:37:37,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:37,711 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:37,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:37,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1095320754, now seen corresponding path program 1 times [2019-11-28 20:37:37,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:37:37,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309453500] [2019-11-28 20:37:37,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:37:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:37:37,759 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:37:38,056 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Exception during sending of exit command (exit): Stream closed [2019-11-28 20:37:38,378 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2019-11-28 20:37:38,708 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-11-28 20:37:39,229 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 107 [2019-11-28 20:37:39,331 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:37:39,331 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:37:39,331 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:37:39,331 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:37:39,331 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:37:39,331 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:39,332 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:37:39,332 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:37:39,332 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration8_Lasso [2019-11-28 20:37:39,332 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:37:39,333 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:37:39,335 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 20:37:39,343 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 20:37:39,344 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 20:37:39,346 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 20:37:39,348 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 20:37:39,349 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 20:37:39,351 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 20:37:39,601 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-11-28 20:37:39,713 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 20:37:39,715 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 20:37:39,716 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 20:37:39,720 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 20:37:39,721 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 20:37:39,722 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 20:37:39,723 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 20:37:39,726 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 20:37:39,728 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 20:37:39,730 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 20:37:39,731 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 20:37:39,733 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 20:37:39,735 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 20:37:39,737 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 20:37:39,738 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 20:37:39,739 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 20:37:39,741 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 20:37:40,195 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:37:40,195 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:40,205 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 20:37:40,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:40,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:40,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:40,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:40,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:40,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:40,211 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:40,217 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 20:37:40,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:40,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:40,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:40,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:40,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:40,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:40,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:40,220 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 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:40,227 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 20:37:40,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:40,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:40,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:40,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:40,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:40,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:40,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:40,230 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 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:40,235 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 20:37:40,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:40,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:40,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:40,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:40,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:40,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:40,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:40,238 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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:40,243 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 20:37:40,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:40,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:37:40,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:40,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:40,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:40,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:37:40,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:37:40,247 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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:40,253 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 20:37:40,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:37:40,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:37:40,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:37:40,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:37:40,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:37:40,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:37:40,286 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:37:40,336 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-11-28 20:37:40,336 INFO L444 ModelExtractionUtils]: 11 out of 34 variables were initially zero. Simplification set additionally 20 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:37:40,343 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:37:40,346 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:37:40,347 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:37:40,347 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~size) = -1*selectionSort_~index~0 + 1*selectionSort_~size Supporting invariants [] [2019-11-28 20:37:40,416 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2019-11-28 20:37:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:40,472 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:37:40,473 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:40,482 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:37:40,483 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:40,490 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 20:37:40,490 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 20:37:40,491 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-28 20:37:40,511 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 8 states. [2019-11-28 20:37:40,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:37:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:37:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-28 20:37:40,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-28 20:37:40,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:40,513 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:37:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:40,553 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:37:40,555 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:40,564 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:37:40,564 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:40,575 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 20:37:40,575 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:37:40,576 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-28 20:37:40,598 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 8 states. [2019-11-28 20:37:40,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:37:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:37:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-28 20:37:40,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-28 20:37:40,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:40,602 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:37:40,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:37:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:40,638 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:37:40,640 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:37:40,653 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:37:40,654 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:37:40,663 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 20:37:40,664 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 2 loop predicates [2019-11-28 20:37:40,664 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-28 20:37:40,681 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 36 states and 47 transitions. Complement of second has 7 states. [2019-11-28 20:37:40,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:37:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:37:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-11-28 20:37:40,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-28 20:37:40,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:40,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 27 letters. Loop has 3 letters. [2019-11-28 20:37:40,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:40,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 6 letters. [2019-11-28 20:37:40,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:37:40,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-11-28 20:37:40,684 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:37:40,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2019-11-28 20:37:40,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:37:40,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:37:40,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:37:40,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:37:40,685 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:37:40,685 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:37:40,685 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:37:40,685 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 20:37:40,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:37:40,685 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:37:40,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:37:40,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:37:40 BoogieIcfgContainer [2019-11-28 20:37:40,692 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:37:40,693 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:37:40,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:37:40,693 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:37:40,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:30" (3/4) ... [2019-11-28 20:37:40,698 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:37:40,698 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:37:40,700 INFO L168 Benchmark]: Toolchain (without parser) took 11232.27 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.8 MB). Free memory was 953.7 MB in the beginning and 943.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 341.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:37:40,700 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:37:40,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.76 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 942.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:37:40,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:37:40,702 INFO L168 Benchmark]: Boogie Preprocessor took 26.38 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 20:37:40,702 INFO L168 Benchmark]: RCFGBuilder took 340.29 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:37:40,703 INFO L168 Benchmark]: BuchiAutomizer took 10499.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.9 MB). Free memory was 1.1 GB in the beginning and 943.0 MB in the end (delta: 160.8 MB). Peak memory consumption was 353.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:37:40,703 INFO L168 Benchmark]: Witness Printer took 5.12 ms. Allocated memory is still 1.4 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:37:40,706 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.76 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 942.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.38 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 340.29 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10499.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.9 MB). Free memory was 1.1 GB in the beginning and 943.0 MB in the end (delta: 160.8 MB). Peak memory consumption was 353.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.12 ms. Allocated memory is still 1.4 GB. Free memory is still 943.0 MB. 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 8 terminating modules (4 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + unknown-#length-unknown[a] and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(startIndex) + \old(size) and consists of 4 locations. One deterministic module has affine ranking function -1 * index + size and consists of 4 locations. One nondeterministic module has affine ranking function -1 * index + size and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.4s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 9.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 118 SDtfs, 135 SDslu, 119 SDs, 0 SdLazy, 244 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital189 mio100 ax100 hnf99 lsp96 ukn71 mio100 lsp63 div100 bol100 ite100 ukn100 eq163 hnf89 smp94 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...