./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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 --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 ff7f98b41a2da3578e790df894a867e943a0857e97661a8032b524a76ca3b438 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:28:40,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:28:40,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:28:40,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:28:40,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:28:40,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:28:40,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:28:40,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:28:40,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:28:40,823 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:28:40,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:28:40,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:28:40,824 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:28:40,824 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:28:40,826 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:28:40,826 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:28:40,826 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:28:40,826 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:28:40,827 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:28:40,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:28:40,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:28:40,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:28:40,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:28:40,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:28:40,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:28:40,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:28:40,829 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:28:40,829 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:28:40,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:28:40,829 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:28:40,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:28:40,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:28:40,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:28:40,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:28:40,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:28:40,833 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:28:40,834 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 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 -> ff7f98b41a2da3578e790df894a867e943a0857e97661a8032b524a76ca3b438 [2024-11-09 15:28:41,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:28:41,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:28:41,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:28:41,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:28:41,063 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:28:41,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2024-11-09 15:28:42,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:28:42,513 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:28:42,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2024-11-09 15:28:42,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3950cdf11/1079115b61bd47cebbc0c500139e2522/FLAG743dc4487 [2024-11-09 15:28:42,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3950cdf11/1079115b61bd47cebbc0c500139e2522 [2024-11-09 15:28:42,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:28:42,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:28:42,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:28:42,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:28:42,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:28:42,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:28:42" (1/1) ... [2024-11-09 15:28:42,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1154c2fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:42, skipping insertion in model container [2024-11-09 15:28:42,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:28:42" (1/1) ... [2024-11-09 15:28:42,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:28:43,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:28:43,120 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:28:43,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:28:43,150 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:28:43,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:43 WrapperNode [2024-11-09 15:28:43,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:28:43,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:28:43,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:28:43,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:28:43,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:43" (1/1) ... [2024-11-09 15:28:43,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:43" (1/1) ... [2024-11-09 15:28:43,180 INFO L138 Inliner]: procedures = 11, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2024-11-09 15:28:43,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:28:43,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:28:43,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:28:43,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:28:43,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:43" (1/1) ... [2024-11-09 15:28:43,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:43" (1/1) ... [2024-11-09 15:28:43,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:43" (1/1) ... [2024-11-09 15:28:43,207 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-11-09 15:28:43,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:43" (1/1) ... [2024-11-09 15:28:43,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:43" (1/1) ... [2024-11-09 15:28:43,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:43" (1/1) ... [2024-11-09 15:28:43,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:43" (1/1) ... [2024-11-09 15:28:43,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:43" (1/1) ... [2024-11-09 15:28:43,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:43" (1/1) ... [2024-11-09 15:28:43,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:28:43,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:28:43,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:28:43,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:28:43,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:43" (1/1) ... [2024-11-09 15:28:43,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:43,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:43,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:43,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:28:43,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:28:43,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 15:28:43,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:28:43,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:28:43,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:28:43,313 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2024-11-09 15:28:43,313 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2024-11-09 15:28:43,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:28:43,388 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:28:43,390 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:28:43,514 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 15:28:43,516 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:28:43,526 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:28:43,526 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 15:28:43,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:43 BoogieIcfgContainer [2024-11-09 15:28:43,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:28:43,527 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:28:43,527 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:28:43,530 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:28:43,530 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:43,530 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:28:42" (1/3) ... [2024-11-09 15:28:43,531 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@745eb01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:28:43, skipping insertion in model container [2024-11-09 15:28:43,531 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:43,531 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:43" (2/3) ... [2024-11-09 15:28:43,532 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@745eb01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:28:43, skipping insertion in model container [2024-11-09 15:28:43,532 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:43,532 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:43" (3/3) ... [2024-11-09 15:28:43,533 INFO L332 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive.i [2024-11-09 15:28:43,572 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:28:43,572 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:28:43,572 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:28:43,572 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:28:43,572 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:28:43,572 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:28:43,572 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:28:43,573 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:28:43,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:28:43,589 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-09 15:28:43,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:43,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:43,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:28:43,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:43,593 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:28:43,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:28:43,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-09 15:28:43,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:43,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:43,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:28:43,595 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:43,600 INFO L745 eck$LassoCheckResult]: Stem: 18#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~post9#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet6#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 6#L31true assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 9#L36-3true [2024-11-09 15:28:43,601 INFO L747 eck$LassoCheckResult]: Loop: 9#L36-3true assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 10#L36-2true main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9#L36-3true [2024-11-09 15:28:43,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:43,606 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-09 15:28:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:43,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664432916] [2024-11-09 15:28:43,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:43,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:43,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:43,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:43,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2024-11-09 15:28:43,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:43,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904626050] [2024-11-09 15:28:43,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:43,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:43,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:43,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:43,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:43,739 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2024-11-09 15:28:43,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:43,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530506408] [2024-11-09 15:28:43,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:43,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:43,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:43,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:43,990 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:43,991 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:43,991 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:43,991 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:43,991 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:43,991 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:43,991 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:43,991 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:43,992 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration1_Lasso [2024-11-09 15:28:43,992 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:43,992 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:44,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:44,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:44,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:44,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:44,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:44,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:44,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:44,266 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:44,270 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:44,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:44,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:44,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:44,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 15:28:44,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:44,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:44,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:44,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:44,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:44,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:44,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:44,303 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:44,322 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-09 15:28:44,322 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-09 15:28:44,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:44,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:44,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:44,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:28:44,346 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:44,359 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:28:44,360 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:44,360 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2024-11-09 15:28:44,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:44,381 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-11-09 15:28:44,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:44,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:28:44,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:44,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:28:44,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:44,468 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:28:44,470 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 20 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:44,519 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 20 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 53 transitions. Complement of second has 7 states. [2024-11-09 15:28:44,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2024-11-09 15:28:44,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-09 15:28:44,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:44,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-09 15:28:44,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:44,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-09 15:28:44,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:44,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2024-11-09 15:28:44,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:28:44,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 15 states and 20 transitions. [2024-11-09 15:28:44,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-09 15:28:44,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-09 15:28:44,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2024-11-09 15:28:44,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:44,541 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-09 15:28:44,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2024-11-09 15:28:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-09 15:28:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-11-09 15:28:44,564 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-09 15:28:44,564 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-09 15:28:44,564 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:28:44,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2024-11-09 15:28:44,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:28:44,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:44,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:44,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:28:44,566 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:28:44,566 INFO L745 eck$LassoCheckResult]: Stem: 118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 115#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~post9#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet6#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 110#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 111#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 112#L36-4 havoc main_~i~0#1; 106#L40 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 116#$Ultimate##0 [2024-11-09 15:28:44,566 INFO L747 eck$LassoCheckResult]: Loop: 116#$Ultimate##0 ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 117#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 107#L14-3 assume !true; 108#L14-4 havoc ~index~0;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int#0(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 105#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 116#$Ultimate##0 [2024-11-09 15:28:44,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:44,567 INFO L85 PathProgramCache]: Analyzing trace with hash 889572457, now seen corresponding path program 1 times [2024-11-09 15:28:44,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:44,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408862582] [2024-11-09 15:28:44,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:44,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:44,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408862582] [2024-11-09 15:28:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408862582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:44,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:44,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:28:44,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291764511] [2024-11-09 15:28:44,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:44,668 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:44,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash 54535472, now seen corresponding path program 1 times [2024-11-09 15:28:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:44,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813742336] [2024-11-09 15:28:44,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:44,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:44,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:44,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813742336] [2024-11-09 15:28:44,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813742336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:44,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:44,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:28:44,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317589694] [2024-11-09 15:28:44,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:44,684 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:28:44,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:44,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 15:28:44,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 15:28:44,687 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:44,692 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2024-11-09 15:28:44,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2024-11-09 15:28:44,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:28:44,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2024-11-09 15:28:44,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-09 15:28:44,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-09 15:28:44,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2024-11-09 15:28:44,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:44,694 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-09 15:28:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2024-11-09 15:28:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-09 15:28:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-11-09 15:28:44,696 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-09 15:28:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 15:28:44,696 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-09 15:28:44,696 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:28:44,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2024-11-09 15:28:44,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:28:44,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:44,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:44,697 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:28:44,697 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:28:44,698 INFO L745 eck$LassoCheckResult]: Stem: 154#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~post9#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet6#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 146#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 147#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 148#L36-4 havoc main_~i~0#1; 142#L40 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 153#$Ultimate##0 [2024-11-09 15:28:44,698 INFO L747 eck$LassoCheckResult]: Loop: 153#$Ultimate##0 ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 152#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 143#L14-3 assume !(~index~0 < ~size); 144#L14-4 havoc ~index~0;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int#0(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 141#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 153#$Ultimate##0 [2024-11-09 15:28:44,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:44,698 INFO L85 PathProgramCache]: Analyzing trace with hash 889572457, now seen corresponding path program 2 times [2024-11-09 15:28:44,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:44,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865684432] [2024-11-09 15:28:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:44,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:44,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:44,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865684432] [2024-11-09 15:28:44,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865684432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:44,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:44,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:28:44,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487999316] [2024-11-09 15:28:44,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:44,744 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:44,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:44,745 INFO L85 PathProgramCache]: Analyzing trace with hash 54524901, now seen corresponding path program 1 times [2024-11-09 15:28:44,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:44,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419615743] [2024-11-09 15:28:44,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:44,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:44,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:44,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419615743] [2024-11-09 15:28:44,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419615743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:44,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:44,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:28:44,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208044777] [2024-11-09 15:28:44,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:44,772 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:28:44,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:44,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:28:44,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:28:44,773 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:44,791 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2024-11-09 15:28:44,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2024-11-09 15:28:44,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:44,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2024-11-09 15:28:44,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-09 15:28:44,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-09 15:28:44,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2024-11-09 15:28:44,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:44,793 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-09 15:28:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2024-11-09 15:28:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-09 15:28:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-11-09 15:28:44,796 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-09 15:28:44,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:28:44,798 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-09 15:28:44,798 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:28:44,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-11-09 15:28:44,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:44,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:44,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:44,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:28:44,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:44,799 INFO L745 eck$LassoCheckResult]: Stem: 193#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 187#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~post9#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet6#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 184#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 185#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 188#L36-4 havoc main_~i~0#1; 179#L40 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 192#$Ultimate##0 [2024-11-09 15:28:44,800 INFO L747 eck$LassoCheckResult]: Loop: 192#$Ultimate##0 ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 191#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 182#L14-3 assume !!(~index~0 < ~size);call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 183#L16 assume #t~mem1 < #t~mem2;havoc #t~mem1;havoc #t~mem2;~minIndex~0 := ~index~0; 178#L14-2 #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; 181#L14-3 assume !(~index~0 < ~size); 186#L14-4 havoc ~index~0;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int#0(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 180#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 192#$Ultimate##0 [2024-11-09 15:28:44,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash 889572457, now seen corresponding path program 3 times [2024-11-09 15:28:44,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:44,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717711751] [2024-11-09 15:28:44,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:44,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:44,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:44,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717711751] [2024-11-09 15:28:44,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717711751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:44,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:44,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:28:44,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454751784] [2024-11-09 15:28:44,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:44,853 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:44,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:44,854 INFO L85 PathProgramCache]: Analyzing trace with hash 903326980, now seen corresponding path program 1 times [2024-11-09 15:28:44,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:44,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230708451] [2024-11-09 15:28:44,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:44,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:44,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:44,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:44,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 15:28:45,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:45,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:28:45,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:28:45,219 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:45,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:45,231 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-11-09 15:28:45,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2024-11-09 15:28:45,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:45,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2024-11-09 15:28:45,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-09 15:28:45,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-09 15:28:45,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2024-11-09 15:28:45,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:45,232 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-09 15:28:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2024-11-09 15:28:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-09 15:28:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-09 15:28:45,234 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-09 15:28:45,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:28:45,236 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-09 15:28:45,236 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:28:45,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2024-11-09 15:28:45,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:45,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:45,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:45,237 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:45,237 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:45,237 INFO L745 eck$LassoCheckResult]: Stem: 232#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 226#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~post9#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet6#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 223#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 224#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 227#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 228#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 229#L36-4 havoc main_~i~0#1; 218#L40 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 231#$Ultimate##0 [2024-11-09 15:28:45,237 INFO L747 eck$LassoCheckResult]: Loop: 231#$Ultimate##0 ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 230#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 221#L14-3 assume !!(~index~0 < ~size);call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 222#L16 assume #t~mem1 < #t~mem2;havoc #t~mem1;havoc #t~mem2;~minIndex~0 := ~index~0; 217#L14-2 #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; 220#L14-3 assume !(~index~0 < ~size); 225#L14-4 havoc ~index~0;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int#0(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 219#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 231#$Ultimate##0 [2024-11-09 15:28:45,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:45,238 INFO L85 PathProgramCache]: Analyzing trace with hash 182329415, now seen corresponding path program 1 times [2024-11-09 15:28:45,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:45,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982858629] [2024-11-09 15:28:45,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:45,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:45,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash 903326980, now seen corresponding path program 2 times [2024-11-09 15:28:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014078303] [2024-11-09 15:28:45,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:45,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:45,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:45,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1689508022, now seen corresponding path program 1 times [2024-11-09 15:28:45,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:45,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350798969] [2024-11-09 15:28:45,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:45,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:28:45,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:45,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350798969] [2024-11-09 15:28:45,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350798969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:45,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719825552] [2024-11-09 15:28:45,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:45,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:45,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:45,426 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:28:45,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 15:28:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:45,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:28:45,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:28:45,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:28:45,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719825552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:45,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:45,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-09 15:28:45,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161499853] [2024-11-09 15:28:45,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:45,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:45,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 15:28:45,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 15:28:45,850 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:45,908 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-11-09 15:28:45,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2024-11-09 15:28:45,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:45,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 22 transitions. [2024-11-09 15:28:45,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-09 15:28:45,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-09 15:28:45,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-11-09 15:28:45,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:45,910 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-09 15:28:45,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-11-09 15:28:45,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-09 15:28:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-09 15:28:45,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-09 15:28:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 15:28:45,912 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-09 15:28:45,912 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:28:45,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2024-11-09 15:28:45,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:45,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:45,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:45,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:45,914 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:45,915 INFO L745 eck$LassoCheckResult]: Stem: 381#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 374#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~post9#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet6#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 372#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 373#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 375#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 376#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 377#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 382#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 380#L36-4 havoc main_~i~0#1; 366#L40 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 379#$Ultimate##0 [2024-11-09 15:28:45,915 INFO L747 eck$LassoCheckResult]: Loop: 379#$Ultimate##0 ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 378#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 369#L14-3 assume !!(~index~0 < ~size);call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 370#L16 assume #t~mem1 < #t~mem2;havoc #t~mem1;havoc #t~mem2;~minIndex~0 := ~index~0; 365#L14-2 #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; 368#L14-3 assume !(~index~0 < ~size); 371#L14-4 havoc ~index~0;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int#0(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 367#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 379#$Ultimate##0 [2024-11-09 15:28:45,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash -873401179, now seen corresponding path program 2 times [2024-11-09 15:28:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:45,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301806297] [2024-11-09 15:28:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:45,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:45,942 INFO L85 PathProgramCache]: Analyzing trace with hash 903326980, now seen corresponding path program 3 times [2024-11-09 15:28:45,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:45,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567180817] [2024-11-09 15:28:45,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:45,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:45,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:45,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1198243240, now seen corresponding path program 2 times [2024-11-09 15:28:45,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:45,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994913228] [2024-11-09 15:28:45,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:45,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:46,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:46,517 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:46,517 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:46,517 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:46,517 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:46,517 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:46,518 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,518 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:46,518 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:46,518 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration6_Lasso [2024-11-09 15:28:46,518 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:46,518 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:46,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:47,013 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:47,013 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:47,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,015 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:47,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:28:47,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:47,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:47,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:47,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:47,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:47,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,042 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:47,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:28:47,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:47,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:47,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:47,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:47,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-09 15:28:47,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:47,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:28:47,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:47,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:47,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:47,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:47,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-09 15:28:47,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,092 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:47,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 15:28:47,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:47,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:47,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:47,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:47,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:47,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,122 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:47,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 15:28:47,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:47,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:47,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:47,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:47,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-09 15:28:47,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,146 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:47,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-09 15:28:47,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:47,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:47,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:47,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:47,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-09 15:28:47,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,170 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:47,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 15:28:47,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:47,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:47,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:47,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:47,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-09 15:28:47,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,197 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:47,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 15:28:47,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:47,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:47,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:47,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:47,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:47,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,225 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:47,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:28:47,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:47,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:47,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:47,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:47,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-09 15:28:47,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,250 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:47,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 15:28:47,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:47,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:47,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:47,274 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:47,290 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-09 15:28:47,291 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-09 15:28:47,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,292 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:47,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:28:47,296 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:47,308 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:28:47,308 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:47,308 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_#in~startIndex, selectionSort_#in~size) = -1*selectionSort_#in~startIndex + 1*selectionSort_#in~size Supporting invariants [] [2024-11-09 15:28:47,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-09 15:28:47,329 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2024-11-09 15:28:47,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:28:47,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:28:47,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:28:47,421 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-09 15:28:47,422 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:47,466 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 49 transitions. Complement of second has 11 states. [2024-11-09 15:28:47,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-09 15:28:47,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 8 letters. [2024-11-09 15:28:47,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:47,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 18 letters. Loop has 8 letters. [2024-11-09 15:28:47,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:47,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 16 letters. [2024-11-09 15:28:47,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:47,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2024-11-09 15:28:47,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-09 15:28:47,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 36 states and 45 transitions. [2024-11-09 15:28:47,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-09 15:28:47,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-09 15:28:47,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2024-11-09 15:28:47,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:47,470 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-09 15:28:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2024-11-09 15:28:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2024-11-09 15:28:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:47,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-11-09 15:28:47,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-11-09 15:28:47,472 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-11-09 15:28:47,472 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:28:47,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2024-11-09 15:28:47,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:47,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:47,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:47,472 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:47,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:47,473 INFO L745 eck$LassoCheckResult]: Stem: 536#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 527#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~post9#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet6#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 524#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 525#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 528#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 529#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 530#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 537#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 534#L36-4 havoc main_~i~0#1; 516#L40 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 535#$Ultimate##0 ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 532#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 517#L14-3 [2024-11-09 15:28:47,473 INFO L747 eck$LassoCheckResult]: Loop: 517#L14-3 assume !!(~index~0 < ~size);call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 521#L16 assume #t~mem1 < #t~mem2;havoc #t~mem1;havoc #t~mem2;~minIndex~0 := ~index~0; 515#L14-2 #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; 517#L14-3 [2024-11-09 15:28:47,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1819909431, now seen corresponding path program 1 times [2024-11-09 15:28:47,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:47,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193960785] [2024-11-09 15:28:47,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:47,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:47,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:47,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:47,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:47,491 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2024-11-09 15:28:47,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:47,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991783226] [2024-11-09 15:28:47,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:47,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:47,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:47,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:47,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:47,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1549642686, now seen corresponding path program 1 times [2024-11-09 15:28:47,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:47,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775555499] [2024-11-09 15:28:47,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:47,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:47,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:47,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:47,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:47,981 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:47,981 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:47,981 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:47,981 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:47,981 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:47,982 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,982 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:47,982 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:47,982 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration7_Lasso [2024-11-09 15:28:47,982 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:47,982 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:47,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:47,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:47,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:47,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,358 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:48,358 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:48,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:48,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:48,360 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:48,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:28:48,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:48,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:48,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:48,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:48,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:48,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:48,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:48,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:48,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-09 15:28:48,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:48,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:48,390 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:48,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:28:48,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:48,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:48,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:48,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:48,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:48,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:48,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:48,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:48,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:48,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-09 15:28:48,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:48,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:48,419 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:48,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:28:48,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:48,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:48,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:48,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:48,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:48,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:48,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:48,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:48,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-09 15:28:48,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:48,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:48,463 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:48,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:28:48,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:48,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:48,475 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-09 15:28:48,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:48,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:48,478 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-09 15:28:48,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:48,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:48,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-09 15:28:48,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:48,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:48,497 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:48,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:28:48,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:48,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:48,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:48,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:48,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:48,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:48,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:48,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:48,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-09 15:28:48,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:48,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:48,528 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:48,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:28:48,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:48,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:48,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:48,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:48,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:48,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:48,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:48,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:48,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-09 15:28:48,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:48,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:48,561 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:48,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:28:48,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:48,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:48,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:48,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:48,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:48,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:48,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:48,586 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:48,607 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-09 15:28:48,607 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-09 15:28:48,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:48,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:48,608 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:48,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 15:28:48,611 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:48,621 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-09 15:28:48,621 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:48,621 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0) = -2*selectionSort_~index~0 + 3 Supporting invariants [-1*selectionSort_~size + 2 >= 0] [2024-11-09 15:28:48,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:48,647 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-09 15:28:48,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:48,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:28:48,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:48,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:28:48,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:48,782 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2024-11-09 15:28:48,782 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 9 Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:48,882 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 9. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 64 transitions. Complement of second has 13 states. [2024-11-09 15:28:48,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 1 non-accepting loop states 2 accepting loop states [2024-11-09 15:28:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2024-11-09 15:28:48,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 25 transitions. Stem has 12 letters. Loop has 3 letters. [2024-11-09 15:28:48,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:48,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 25 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-09 15:28:48,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:48,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 25 transitions. Stem has 12 letters. Loop has 6 letters. [2024-11-09 15:28:48,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:48,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2024-11-09 15:28:48,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:48,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 39 states and 49 transitions. [2024-11-09 15:28:48,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-09 15:28:48,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-09 15:28:48,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2024-11-09 15:28:48,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:48,886 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-09 15:28:48,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2024-11-09 15:28:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2024-11-09 15:28:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-09 15:28:48,892 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-09 15:28:48,892 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-09 15:28:48,892 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:28:48,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2024-11-09 15:28:48,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:48,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:48,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:48,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:48,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:48,893 INFO L745 eck$LassoCheckResult]: Stem: 726#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 719#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~post9#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet6#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 714#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 715#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 716#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 717#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 718#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 720#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 730#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 729#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 728#L36-4 havoc main_~i~0#1; 704#L40 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 727#$Ultimate##0 ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 721#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 706#L14-3 [2024-11-09 15:28:48,893 INFO L747 eck$LassoCheckResult]: Loop: 706#L14-3 assume !!(~index~0 < ~size);call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 710#L16 assume #t~mem1 < #t~mem2;havoc #t~mem1;havoc #t~mem2;~minIndex~0 := ~index~0; 703#L14-2 #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; 706#L14-3 [2024-11-09 15:28:48,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:48,893 INFO L85 PathProgramCache]: Analyzing trace with hash 742119463, now seen corresponding path program 2 times [2024-11-09 15:28:48,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:48,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250731193] [2024-11-09 15:28:48,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:48,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:48,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:48,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:48,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:48,913 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2024-11-09 15:28:48,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:48,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050039336] [2024-11-09 15:28:48,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:48,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:48,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:48,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:48,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:48,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2010678748, now seen corresponding path program 2 times [2024-11-09 15:28:48,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:48,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734645909] [2024-11-09 15:28:48,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:48,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:48,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:48,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:49,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-09 15:28:49,392 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:49,392 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:49,392 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:49,392 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:49,393 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:49,393 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,393 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:49,393 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:49,393 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration8_Lasso [2024-11-09 15:28:49,393 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:49,393 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:49,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,752 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:49,752 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:49,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,754 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:28:49,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:49,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:49,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:49,767 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:49,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,780 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 15:28:49,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:49,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:49,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:49,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,807 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 15:28:49,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:49,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:49,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:49,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:49,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,839 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 15:28:49,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:49,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:49,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:49,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-09 15:28:49,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,865 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:28:49,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:49,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:49,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:49,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:49,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,890 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:28:49,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:49,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:49,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:49,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:49,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,915 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-09 15:28:49,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:49,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:49,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:49,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:49,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,942 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-09 15:28:49,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:49,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:49,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:49,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,969 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-09 15:28:49,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:49,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:49,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:49,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-09 15:28:49,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,995 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-09 15:28:49,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:50,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:50,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:50,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:50,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:50,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:50,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:50,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:50,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:50,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:50,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:50,023 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:50,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-09 15:28:50,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:50,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:50,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:50,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:50,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:50,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:50,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:50,047 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:50,077 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2024-11-09 15:28:50,077 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-09 15:28:50,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:50,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:50,078 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:50,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-09 15:28:50,080 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:50,090 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-09 15:28:50,090 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:50,091 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length selectionSort_~array.base)_2, selectionSort_~index~0) = 1*v_rep(select #length selectionSort_~array.base)_2 - 4*selectionSort_~index~0 Supporting invariants [1*selectionSort_~array.offset >= 0] [2024-11-09 15:28:50,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:50,112 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2024-11-09 15:28:50,114 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:28:50,115 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:28:50,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:50,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:28:50,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:50,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:50,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:28:50,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:50,254 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-09 15:28:50,254 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:50,304 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 56 transitions. Complement of second has 8 states. [2024-11-09 15:28:50,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-11-09 15:28:50,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2024-11-09 15:28:50,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:50,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 17 letters. Loop has 3 letters. [2024-11-09 15:28:50,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:50,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 14 letters. Loop has 6 letters. [2024-11-09 15:28:50,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:50,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2024-11-09 15:28:50,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:50,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 33 states and 41 transitions. [2024-11-09 15:28:50,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-09 15:28:50,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-09 15:28:50,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2024-11-09 15:28:50,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:50,309 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-09 15:28:50,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2024-11-09 15:28:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2024-11-09 15:28:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-09 15:28:50,311 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-09 15:28:50,311 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-09 15:28:50,311 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:28:50,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-11-09 15:28:50,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:50,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:50,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:50,312 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:50,312 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:50,312 INFO L745 eck$LassoCheckResult]: Stem: 908#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 901#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~post9#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet6#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 896#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 897#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 898#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 899#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 900#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 902#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 906#L36-4 havoc main_~i~0#1; 890#L40 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 907#$Ultimate##0 ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 904#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 893#L14-3 assume !!(~index~0 < ~size);call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 894#L16 assume !(#t~mem1 < #t~mem2);havoc #t~mem1;havoc #t~mem2; 889#L14-2 #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; 891#L14-3 assume !(~index~0 < ~size); 895#L14-4 havoc ~index~0;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int#0(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 887#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 905#$Ultimate##0 ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 903#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 888#L14-3 [2024-11-09 15:28:50,312 INFO L747 eck$LassoCheckResult]: Loop: 888#L14-3 assume !!(~index~0 < ~size);call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 892#L16 assume #t~mem1 < #t~mem2;havoc #t~mem1;havoc #t~mem2;~minIndex~0 := ~index~0; 886#L14-2 #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; 888#L14-3 [2024-11-09 15:28:50,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:50,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2059440754, now seen corresponding path program 1 times [2024-11-09 15:28:50,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:50,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898442432] [2024-11-09 15:28:50,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:50,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:28:50,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:50,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898442432] [2024-11-09 15:28:50,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898442432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:50,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687657822] [2024-11-09 15:28:50,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:50,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:50,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:50,446 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:28:50,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-09 15:28:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:50,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 15:28:50,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:28:50,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:28:50,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687657822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:50,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:50,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-09 15:28:50,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533812599] [2024-11-09 15:28:50,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:50,629 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:50,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:50,629 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2024-11-09 15:28:50,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:50,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25564514] [2024-11-09 15:28:50,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:50,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:50,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:50,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:50,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:50,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 15:28:50,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-09 15:28:50,687 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:50,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:50,774 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-11-09 15:28:50,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2024-11-09 15:28:50,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:50,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 26 states and 31 transitions. [2024-11-09 15:28:50,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:28:50,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:28:50,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2024-11-09 15:28:50,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:50,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-09 15:28:50,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2024-11-09 15:28:50,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-09 15:28:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:50,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-09 15:28:50,776 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-09 15:28:50,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 15:28:50,777 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-09 15:28:50,777 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:28:50,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2024-11-09 15:28:50,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:50,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:50,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:50,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:50,778 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:50,778 INFO L745 eck$LassoCheckResult]: Stem: 1108#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1098#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~post9#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet6#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 1095#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 1096#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 1099#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1110#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 1102#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1100#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 1101#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1109#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 1106#L36-4 havoc main_~i~0#1; 1090#L40 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 1107#$Ultimate##0 ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 1104#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 1093#L14-3 assume !!(~index~0 < ~size);call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1094#L16 assume !(#t~mem1 < #t~mem2);havoc #t~mem1;havoc #t~mem2; 1089#L14-2 #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; 1091#L14-3 assume !(~index~0 < ~size); 1097#L14-4 havoc ~index~0;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int#0(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1087#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 1105#$Ultimate##0 ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 1103#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 1088#L14-3 [2024-11-09 15:28:50,778 INFO L747 eck$LassoCheckResult]: Loop: 1088#L14-3 assume !!(~index~0 < ~size);call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1092#L16 assume #t~mem1 < #t~mem2;havoc #t~mem1;havoc #t~mem2;~minIndex~0 := ~index~0; 1086#L14-2 #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; 1088#L14-3 [2024-11-09 15:28:50,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:50,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1355850988, now seen corresponding path program 2 times [2024-11-09 15:28:50,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:50,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143214027] [2024-11-09 15:28:50,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:50,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:50,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143214027] [2024-11-09 15:28:50,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143214027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:50,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253603003] [2024-11-09 15:28:50,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:28:50,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:50,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:50,899 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:28:50,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-09 15:28:50,951 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:28:50,951 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:28:50,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:28:50,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:51,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:51,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253603003] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:51,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:51,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-11-09 15:28:51,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604325356] [2024-11-09 15:28:51,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:51,115 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:51,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:51,116 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2024-11-09 15:28:51,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:51,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664865104] [2024-11-09 15:28:51,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:51,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:51,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:51,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:51,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:51,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 15:28:51,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-09 15:28:51,176 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. cyclomatic complexity: 8 Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:51,334 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-11-09 15:28:51,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 47 transitions. [2024-11-09 15:28:51,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:51,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 47 transitions. [2024-11-09 15:28:51,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-09 15:28:51,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:28:51,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 47 transitions. [2024-11-09 15:28:51,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:51,336 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-09 15:28:51,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 47 transitions. [2024-11-09 15:28:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2024-11-09 15:28:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-09 15:28:51,337 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-09 15:28:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 15:28:51,338 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-09 15:28:51,338 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:28:51,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2024-11-09 15:28:51,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:51,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:51,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:51,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:51,339 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:51,339 INFO L745 eck$LassoCheckResult]: Stem: 1328#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1318#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~post9#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet6#1;main_~n~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 1316#L31 assume !(main_~n~0#1 < 1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 1317#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 1319#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1320#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 1321#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1332#L36-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet8#1; 1331#L36-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1330#L36-3 assume !(main_~i~0#1 < main_~n~0#1); 1325#L36-4 havoc main_~i~0#1; 1311#L40 call selectionSort(main_~a~0#1.base, main_~a~0#1.offset, 0, main_~n~0#1);< 1326#$Ultimate##0 ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 1327#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 1335#L14-3 assume !!(~index~0 < ~size);call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1334#L16 assume !(#t~mem1 < #t~mem2);havoc #t~mem1;havoc #t~mem2; 1310#L14-2 #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; 1312#L14-3 assume !!(~index~0 < ~size);call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1314#L16 assume !(#t~mem1 < #t~mem2);havoc #t~mem1;havoc #t~mem2; 1329#L14-2 #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; 1333#L14-3 assume !(~index~0 < ~size); 1315#L14-4 havoc ~index~0;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int#0(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1308#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 1322#$Ultimate##0 ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 1323#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 1309#L14-3 [2024-11-09 15:28:51,339 INFO L747 eck$LassoCheckResult]: Loop: 1309#L14-3 assume !!(~index~0 < ~size);call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1313#L16 assume #t~mem1 < #t~mem2;havoc #t~mem1;havoc #t~mem2;~minIndex~0 := ~index~0; 1307#L14-2 #t~post3 := ~index~0;~index~0 := 1 + #t~post3;havoc #t~post3; 1309#L14-3 [2024-11-09 15:28:51,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:51,340 INFO L85 PathProgramCache]: Analyzing trace with hash 197123111, now seen corresponding path program 3 times [2024-11-09 15:28:51,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:51,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980920238] [2024-11-09 15:28:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:51,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:51,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:51,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:51,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:51,364 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2024-11-09 15:28:51,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:51,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517069842] [2024-11-09 15:28:51,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:51,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:51,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:51,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:51,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:51,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1274344996, now seen corresponding path program 1 times [2024-11-09 15:28:51,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:51,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675381732] [2024-11-09 15:28:51,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:51,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:51,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:51,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:52,373 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:52,373 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:52,373 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:52,373 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:52,374 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:52,374 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:52,374 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:52,374 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:52,374 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration11_Lasso [2024-11-09 15:28:52,374 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:52,374 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:52,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:52,792 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:52,793 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:52,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:52,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:52,794 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:52,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-09 15:28:52,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:52,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:52,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:52,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:52,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:52,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:52,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:52,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:52,808 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:52,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:52,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:52,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:52,820 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:52,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-09 15:28:52,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:52,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:52,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:52,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:52,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:52,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:52,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:52,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:52,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:52,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:52,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:52,845 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:52,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-09 15:28:52,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:52,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:52,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:52,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:52,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:52,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:52,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:52,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:52,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:52,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:52,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:52,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:52,870 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:52,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-09 15:28:52,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:52,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:52,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:52,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:52,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:52,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:52,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:52,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:52,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:52,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:52,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:52,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:52,893 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:52,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-09 15:28:52,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:52,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:52,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:52,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:52,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:52,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:52,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:52,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:52,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:52,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:52,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:52,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:52,916 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:52,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-09 15:28:52,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:52,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:52,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:52,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:52,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:52,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:52,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:52,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:52,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:52,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:52,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:52,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:52,940 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:52,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-09 15:28:52,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:52,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:52,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:52,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:52,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:52,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:52,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:52,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:52,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:52,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:52,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:52,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:52,967 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:52,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-09 15:28:52,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:52,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:52,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:52,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:52,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:52,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:52,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:52,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:52,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:52,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-09 15:28:52,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:52,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:52,991 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:52,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-09 15:28:52,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:53,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:53,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:53,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:53,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:53,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:53,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:53,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:53,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:53,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:53,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:53,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:53,015 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:53,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-09 15:28:53,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:53,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:53,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:53,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:53,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:53,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:53,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:53,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:53,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:53,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:53,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:53,042 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:53,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-09 15:28:53,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:53,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:53,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:53,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:53,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:53,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:53,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:53,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:53,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:53,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-09 15:28:53,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:53,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:53,066 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:53,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-09 15:28:53,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:53,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:53,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:53,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:53,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:53,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:53,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:53,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:53,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:53,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-09 15:28:53,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:53,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:53,090 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:53,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-09 15:28:53,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:53,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:53,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:53,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:53,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:53,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:53,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:53,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:53,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:53,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-09 15:28:53,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:53,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:53,114 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:53,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-09 15:28:53,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:53,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:53,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:53,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:53,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:53,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:53,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:53,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:53,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:53,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-09 15:28:53,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:53,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:53,138 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:53,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-09 15:28:53,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:53,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:53,149 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-09 15:28:53,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:53,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:53,151 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-09 15:28:53,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:53,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:53,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:53,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:53,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:53,166 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:53,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-09 15:28:53,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:53,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:53,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:53,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:53,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:53,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:53,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:53,191 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:53,207 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-09 15:28:53,207 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-09 15:28:53,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:53,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:53,209 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:53,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-09 15:28:53,210 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:53,220 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-09 15:28:53,220 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:53,220 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length selectionSort_~array.base)_3, selectionSort_~index~0) = 1*v_rep(select #length selectionSort_~array.base)_3 - 4*selectionSort_~index~0 Supporting invariants [1*selectionSort_~array.offset >= 0] [2024-11-09 15:28:53,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:53,237 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-09 15:28:53,239 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:28:53,239 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:28:53,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:53,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:28:53,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:53,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:28:53,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:53,419 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-09 15:28:53,419 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:53,462 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 48 transitions. Complement of second has 8 states. [2024-11-09 15:28:53,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-11-09 15:28:53,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 25 letters. Loop has 3 letters. [2024-11-09 15:28:53,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:53,463 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:28:53,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:53,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:28:53,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:53,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:28:53,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:53,629 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-09 15:28:53,629 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:53,670 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 48 transitions. Complement of second has 8 states. [2024-11-09 15:28:53,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-11-09 15:28:53,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 25 letters. Loop has 3 letters. [2024-11-09 15:28:53,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:53,671 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:28:53,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:53,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:28:53,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:53,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:53,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:28:53,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:53,871 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-09 15:28:53,871 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:53,913 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 59 transitions. Complement of second has 12 states. [2024-11-09 15:28:53,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2024-11-09 15:28:53,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2024-11-09 15:28:53,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:53,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 28 letters. Loop has 3 letters. [2024-11-09 15:28:53,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:53,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 6 letters. [2024-11-09 15:28:53,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:53,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 59 transitions. [2024-11-09 15:28:53,917 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:28:53,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2024-11-09 15:28:53,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:28:53,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:28:53,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:28:53,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:53,917 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:28:53,917 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:28:53,917 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:28:53,917 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 15:28:53,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:28:53,917 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:28:53,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:28:53,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:28:53 BoogieIcfgContainer [2024-11-09 15:28:53,923 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:28:53,923 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:28:53,923 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:28:53,923 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:28:53,924 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:43" (3/4) ... [2024-11-09 15:28:53,925 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:28:53,926 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:28:53,927 INFO L158 Benchmark]: Toolchain (without parser) took 10991.81ms. Allocated memory was 178.3MB in the beginning and 285.2MB in the end (delta: 107.0MB). Free memory was 108.2MB in the beginning and 233.1MB in the end (delta: -125.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:28:53,927 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 178.3MB. Free memory was 134.1MB in the beginning and 133.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:28:53,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.54ms. Allocated memory is still 178.3MB. Free memory was 108.0MB in the beginning and 96.1MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 15:28:53,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.31ms. Allocated memory is still 178.3MB. Free memory was 96.0MB in the beginning and 94.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:28:53,928 INFO L158 Benchmark]: Boogie Preprocessor took 43.63ms. Allocated memory is still 178.3MB. Free memory was 94.7MB in the beginning and 92.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:28:53,928 INFO L158 Benchmark]: RCFGBuilder took 300.55ms. Allocated memory is still 178.3MB. Free memory was 92.8MB in the beginning and 141.9MB in the end (delta: -49.2MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-11-09 15:28:53,928 INFO L158 Benchmark]: BuchiAutomizer took 10395.83ms. Allocated memory was 178.3MB in the beginning and 285.2MB in the end (delta: 107.0MB). Free memory was 141.9MB in the beginning and 233.1MB in the end (delta: -91.2MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-11-09 15:28:53,928 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 285.2MB. Free memory is still 233.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:28:53,929 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 178.3MB. Free memory was 134.1MB in the beginning and 133.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.54ms. Allocated memory is still 178.3MB. Free memory was 108.0MB in the beginning and 96.1MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.31ms. Allocated memory is still 178.3MB. Free memory was 96.0MB in the beginning and 94.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.63ms. Allocated memory is still 178.3MB. Free memory was 94.7MB in the beginning and 92.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 300.55ms. Allocated memory is still 178.3MB. Free memory was 92.8MB in the beginning and 141.9MB in the end (delta: -49.2MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 10395.83ms. Allocated memory was 178.3MB in the beginning and 285.2MB in the end (delta: 107.0MB). Free memory was 141.9MB in the beginning and 233.1MB in the end (delta: -91.2MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 285.2MB. Free memory is still 233.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long) -1 * i) + n) and consists of 4 locations. One deterministic module has affine ranking function (\old(size) + ((long) -1 * \old(startIndex))) and consists of 4 locations. One deterministic module has affine ranking function (3 + ((long) -2 * index)) and consists of 10 locations. One deterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. 6 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.3s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 8.4s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 46 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 429 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 502 IncrementalHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 140 mSDtfsCounter, 502 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI2 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital165 mio100 ax100 hnf100 lsp96 ukn74 mio100 lsp50 div117 bol100 ite100 ukn100 eq160 hnf92 smp93 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-09 15:28:53,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:54,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:54,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 15:28:54,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE