./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.fs.cvc5-61a6796-m [2024-10-15 00:19:17,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:19:17,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-15 00:19:17,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:19:17,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:19:17,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:19:17,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:19:17,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:19:17,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:19:17,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:19:17,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:19:17,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:19:17,215 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:19:17,215 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:19:17,216 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:19:17,216 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:19:17,217 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:19:17,217 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:19:17,218 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:19:17,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:19:17,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:19:17,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:19:17,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:19:17,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:19:17,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:19:17,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:19:17,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:19:17,221 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:19:17,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:19:17,222 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:19:17,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:19:17,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:19:17,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:19:17,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:19:17,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:19:17,223 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:19:17,223 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-10-15 00:19:17,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:19:17,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:19:17,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:19:17,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:19:17,456 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:19:17,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2024-10-15 00:19:18,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:19:18,920 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:19:18,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2024-10-15 00:19:18,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33515b68/fb0b312da7eb44e99241151aeb1ac935/FLAG76201d98c [2024-10-15 00:19:18,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33515b68/fb0b312da7eb44e99241151aeb1ac935 [2024-10-15 00:19:18,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:19:18,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:19:18,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:19:18,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:19:18,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:19:18,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:19:18" (1/1) ... [2024-10-15 00:19:18,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4990288e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:18, skipping insertion in model container [2024-10-15 00:19:18,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:19:18" (1/1) ... [2024-10-15 00:19:18,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:19:19,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:19:19,140 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:19:19,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:19:19,172 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:19:19,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:19 WrapperNode [2024-10-15 00:19:19,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:19:19,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:19:19,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:19:19,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:19:19,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:19" (1/1) ... [2024-10-15 00:19:19,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:19" (1/1) ... [2024-10-15 00:19:19,207 INFO L138 Inliner]: procedures = 11, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2024-10-15 00:19:19,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:19:19,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:19:19,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:19:19,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:19:19,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:19" (1/1) ... [2024-10-15 00:19:19,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:19" (1/1) ... [2024-10-15 00:19:19,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:19" (1/1) ... [2024-10-15 00:19:19,233 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-10-15 00:19:19,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:19" (1/1) ... [2024-10-15 00:19:19,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:19" (1/1) ... [2024-10-15 00:19:19,239 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:19" (1/1) ... [2024-10-15 00:19:19,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:19" (1/1) ... [2024-10-15 00:19:19,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:19" (1/1) ... [2024-10-15 00:19:19,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:19" (1/1) ... [2024-10-15 00:19:19,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:19:19,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:19:19,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:19:19,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:19:19,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:19" (1/1) ... [2024-10-15 00:19:19,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:19,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:19,287 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-10-15 00:19:19,289 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-10-15 00:19:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 00:19:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-15 00:19:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:19:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:19:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 00:19:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2024-10-15 00:19:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2024-10-15 00:19:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:19:19,388 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:19:19,389 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:19:19,525 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-15 00:19:19,530 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:19:19,546 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:19:19,547 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 00:19:19,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:19:19 BoogieIcfgContainer [2024-10-15 00:19:19,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:19:19,548 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:19:19,548 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:19:19,552 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:19:19,552 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:19:19,552 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:19:18" (1/3) ... [2024-10-15 00:19:19,553 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f014edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:19:19, skipping insertion in model container [2024-10-15 00:19:19,553 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:19:19,553 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:19:19" (2/3) ... [2024-10-15 00:19:19,554 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f014edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:19:19, skipping insertion in model container [2024-10-15 00:19:19,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:19:19,554 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:19:19" (3/3) ... [2024-10-15 00:19:19,555 INFO L332 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive.i [2024-10-15 00:19:19,597 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:19:19,597 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:19:19,597 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:19:19,597 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:19:19,597 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:19:19,598 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:19:19,598 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:19:19,598 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:19:19,601 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-10-15 00:19:19,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-15 00:19:19,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:19,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:19,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:19:19,622 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:19:19,622 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:19:19,622 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-10-15 00:19:19,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-15 00:19:19,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:19,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:19,624 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:19:19,624 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:19:19,631 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-10-15 00:19:19,631 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-10-15 00:19:19,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:19,636 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-10-15 00:19:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:19,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35306872] [2024-10-15 00:19:19,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:19,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:19,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:19,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:19,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:19,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2024-10-15 00:19:19,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:19,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275558157] [2024-10-15 00:19:19,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:19,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:19,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:19,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:19,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:19,789 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2024-10-15 00:19:19,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:19,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821234217] [2024-10-15 00:19:19,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:19,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:19,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:19,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:20,040 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:19:20,041 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:19:20,041 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:19:20,041 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:19:20,042 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:19:20,042 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:20,042 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:19:20,042 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:19:20,042 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration1_Lasso [2024-10-15 00:19:20,042 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:19:20,042 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:19:20,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:20,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:20,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:20,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:20,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:20,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:20,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:20,365 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:19:20,368 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:19:20,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:20,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:20,373 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-10-15 00:19:20,377 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-10-15 00:19:20,378 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-10-15 00:19:20,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:20,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:20,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:20,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:20,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:20,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:20,434 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:19:20,463 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-15 00:19:20,464 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-15 00:19:20,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:20,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:20,469 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-10-15 00:19:20,470 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-10-15 00:19:20,471 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:19:20,485 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:19:20,486 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:19:20,487 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-10-15 00:19:20,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-15 00:19:20,510 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-10-15 00:19:20,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:20,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:19:20,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:20,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:19:20,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:20,605 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-10-15 00:19:20,607 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-10-15 00:19:20,644 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-10-15 00:19:20,646 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-10-15 00:19:20,650 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-10-15 00:19:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2024-10-15 00:19:20,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2024-10-15 00:19:20,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:20,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2024-10-15 00:19:20,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:20,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2024-10-15 00:19:20,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:20,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2024-10-15 00:19:20,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-15 00:19:20,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 15 states and 20 transitions. [2024-10-15 00:19:20,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-15 00:19:20,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-15 00:19:20,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2024-10-15 00:19:20,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:20,660 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-15 00:19:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2024-10-15 00:19:20,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-15 00:19:20,683 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-10-15 00:19:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-10-15 00:19:20,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-15 00:19:20,684 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-15 00:19:20,684 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:19:20,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2024-10-15 00:19:20,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-15 00:19:20,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:20,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:20,686 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:19:20,686 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:19:20,686 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-10-15 00:19:20,686 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-10-15 00:19:20,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:20,687 INFO L85 PathProgramCache]: Analyzing trace with hash 889572457, now seen corresponding path program 1 times [2024-10-15 00:19:20,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:20,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072107009] [2024-10-15 00:19:20,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:20,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:20,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:20,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072107009] [2024-10-15 00:19:20,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072107009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:19:20,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:19:20,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:19:20,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802237125] [2024-10-15 00:19:20,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:19:20,770 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:19:20,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:20,770 INFO L85 PathProgramCache]: Analyzing trace with hash 54535472, now seen corresponding path program 1 times [2024-10-15 00:19:20,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:20,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415272849] [2024-10-15 00:19:20,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:20,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:20,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:20,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415272849] [2024-10-15 00:19:20,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415272849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:19:20,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:19:20,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:19:20,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104194439] [2024-10-15 00:19:20,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:19:20,784 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:19:20,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:20,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 00:19:20,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 00:19:20,787 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-10-15 00:19:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:20,791 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2024-10-15 00:19:20,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2024-10-15 00:19:20,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-15 00:19:20,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2024-10-15 00:19:20,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-15 00:19:20,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-15 00:19:20,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2024-10-15 00:19:20,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:20,793 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-15 00:19:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2024-10-15 00:19:20,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-15 00:19:20,794 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-10-15 00:19:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-10-15 00:19:20,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-15 00:19:20,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 00:19:20,795 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-15 00:19:20,795 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:19:20,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2024-10-15 00:19:20,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-15 00:19:20,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:20,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:20,796 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:19:20,796 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:19:20,797 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-10-15 00:19:20,797 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-10-15 00:19:20,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:20,797 INFO L85 PathProgramCache]: Analyzing trace with hash 889572457, now seen corresponding path program 2 times [2024-10-15 00:19:20,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:20,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035383452] [2024-10-15 00:19:20,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:20,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:20,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:20,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035383452] [2024-10-15 00:19:20,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035383452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:19:20,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:19:20,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:19:20,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840565994] [2024-10-15 00:19:20,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:19:20,838 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:19:20,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:20,838 INFO L85 PathProgramCache]: Analyzing trace with hash 54524901, now seen corresponding path program 1 times [2024-10-15 00:19:20,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:20,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200316674] [2024-10-15 00:19:20,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:20,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:20,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:20,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200316674] [2024-10-15 00:19:20,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200316674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:19:20,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:19:20,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:19:20,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690938155] [2024-10-15 00:19:20,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:19:20,872 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:19:20,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:20,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:19:20,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:19:20,872 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-10-15 00:19:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:20,886 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2024-10-15 00:19:20,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2024-10-15 00:19:20,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:19:20,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2024-10-15 00:19:20,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-15 00:19:20,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:19:20,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2024-10-15 00:19:20,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:20,890 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-15 00:19:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2024-10-15 00:19:20,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-15 00:19:20,891 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-10-15 00:19:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-15 00:19:20,893 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-15 00:19:20,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:19:20,894 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-15 00:19:20,896 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:19:20,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-10-15 00:19:20,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:19:20,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:20,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:20,897 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:19:20,897 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:20,897 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-10-15 00:19:20,897 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-10-15 00:19:20,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:20,898 INFO L85 PathProgramCache]: Analyzing trace with hash 889572457, now seen corresponding path program 3 times [2024-10-15 00:19:20,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:20,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119650424] [2024-10-15 00:19:20,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:20,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:20,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:20,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119650424] [2024-10-15 00:19:20,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119650424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:19:20,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:19:20,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:19:20,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96442912] [2024-10-15 00:19:20,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:19:20,956 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:19:20,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash 903326980, now seen corresponding path program 1 times [2024-10-15 00:19:20,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:20,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094605000] [2024-10-15 00:19:20,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:20,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:20,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:20,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:21,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:21,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:19:21,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:19:21,274 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-10-15 00:19:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:21,286 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-10-15 00:19:21,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2024-10-15 00:19:21,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:19:21,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2024-10-15 00:19:21,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-15 00:19:21,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:19:21,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2024-10-15 00:19:21,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:21,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-15 00:19:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2024-10-15 00:19:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-10-15 00:19:21,289 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-10-15 00:19:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-10-15 00:19:21,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-15 00:19:21,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:19:21,290 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-15 00:19:21,302 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:19:21,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2024-10-15 00:19:21,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:19:21,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:21,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:21,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:21,304 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:21,304 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-10-15 00:19:21,304 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-10-15 00:19:21,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:21,304 INFO L85 PathProgramCache]: Analyzing trace with hash 182329415, now seen corresponding path program 1 times [2024-10-15 00:19:21,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:21,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224920056] [2024-10-15 00:19:21,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:21,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:21,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:21,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:21,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:21,327 INFO L85 PathProgramCache]: Analyzing trace with hash 903326980, now seen corresponding path program 2 times [2024-10-15 00:19:21,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:21,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127440986] [2024-10-15 00:19:21,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:21,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:21,340 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-10-15 00:19:21,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:21,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:21,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1689508022, now seen corresponding path program 1 times [2024-10-15 00:19:21,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:21,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641151960] [2024-10-15 00:19:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:19:21,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:21,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641151960] [2024-10-15 00:19:21,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641151960] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:19:21,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283886953] [2024-10-15 00:19:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:21,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:19:21,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:21,497 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-10-15 00:19:21,499 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-10-15 00:19:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:21,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:19:21,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:19:21,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:19:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:19:21,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283886953] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:19:21,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:19:21,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-15 00:19:21,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267013245] [2024-10-15 00:19:21,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:19:21,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:21,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-15 00:19:21,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-15 00:19:21,927 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-10-15 00:19:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:21,983 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-10-15 00:19:21,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2024-10-15 00:19:21,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:19:21,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 22 transitions. [2024-10-15 00:19:21,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-15 00:19:21,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:19:21,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-10-15 00:19:21,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:21,985 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-15 00:19:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-10-15 00:19:21,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-10-15 00:19:21,988 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-10-15 00:19:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-10-15 00:19:21,989 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-15 00:19:21,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 00:19:21,990 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-15 00:19:21,990 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:19:21,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2024-10-15 00:19:21,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:19:21,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:21,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:21,991 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:21,991 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:21,991 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-10-15 00:19:21,991 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-10-15 00:19:21,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:21,991 INFO L85 PathProgramCache]: Analyzing trace with hash -873401179, now seen corresponding path program 2 times [2024-10-15 00:19:21,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:21,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783021252] [2024-10-15 00:19:21,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:21,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:22,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:22,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:22,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:22,007 INFO L85 PathProgramCache]: Analyzing trace with hash 903326980, now seen corresponding path program 3 times [2024-10-15 00:19:22,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:22,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187770357] [2024-10-15 00:19:22,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:22,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:22,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:22,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:22,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:22,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1198243240, now seen corresponding path program 2 times [2024-10-15 00:19:22,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:22,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888038621] [2024-10-15 00:19:22,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:22,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:22,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:22,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:22,593 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:19:22,593 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:19:22,593 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:19:22,593 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:19:22,593 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:19:22,593 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:22,594 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:19:22,594 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:19:22,594 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration6_Lasso [2024-10-15 00:19:22,594 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:19:22,594 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:19:22,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:22,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:23,023 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:19:23,023 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:19:23,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:23,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:23,025 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-10-15 00:19:23,026 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-10-15 00:19:23,037 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-10-15 00:19:23,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:23,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:23,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:23,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:23,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:23,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:23,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:23,049 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:23,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-15 00:19:23,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:23,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:23,067 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-10-15 00:19:23,068 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-10-15 00:19:23,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-10-15 00:19:23,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:23,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:23,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:23,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:23,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:23,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:23,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:23,083 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:23,095 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-10-15 00:19:23,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:23,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:23,097 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-10-15 00:19:23,098 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-10-15 00:19:23,101 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-10-15 00:19:23,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:23,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:23,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:23,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:23,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:23,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:23,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:23,115 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:23,127 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-10-15 00:19:23,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:23,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:23,128 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-10-15 00:19:23,129 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-10-15 00:19:23,131 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-10-15 00:19:23,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:23,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:23,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:23,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:23,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:23,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:23,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:23,167 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:23,192 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-10-15 00:19:23,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:23,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:23,197 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-10-15 00:19:23,199 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-10-15 00:19:23,200 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-10-15 00:19:23,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:23,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:23,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:23,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:23,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:23,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:23,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:23,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:23,223 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-10-15 00:19:23,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:23,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:23,225 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-10-15 00:19:23,226 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-10-15 00:19:23,227 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-10-15 00:19:23,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:23,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:23,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:23,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:23,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:23,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:23,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:23,239 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:23,250 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-10-15 00:19:23,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:23,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:23,252 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-10-15 00:19:23,253 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-10-15 00:19:23,254 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-10-15 00:19:23,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:23,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:23,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:23,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:23,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:23,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:23,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:23,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:23,278 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-10-15 00:19:23,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:23,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:23,280 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-10-15 00:19:23,281 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-10-15 00:19:23,282 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-10-15 00:19:23,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:23,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:23,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:23,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:23,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:23,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:23,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:23,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:23,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-15 00:19:23,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:23,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:23,310 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-10-15 00:19:23,311 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-10-15 00:19:23,312 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-10-15 00:19:23,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:23,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:23,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:23,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:23,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:23,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:23,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:23,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:23,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:23,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:23,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:23,338 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-10-15 00:19:23,339 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-10-15 00:19:23,340 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-10-15 00:19:23,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:23,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:23,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:23,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:23,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:23,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:23,366 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:19:23,386 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-15 00:19:23,386 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-15 00:19:23,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:23,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:23,388 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-10-15 00:19:23,389 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-10-15 00:19:23,390 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:19:23,402 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:19:23,402 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:19:23,402 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-10-15 00:19:23,414 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-10-15 00:19:23,418 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2024-10-15 00:19:23,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:23,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:19:23,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:23,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:19:23,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:19:23,507 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-10-15 00:19:23,507 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-10-15 00:19:23,548 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-10-15 00:19:23,549 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-10-15 00:19:23,551 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-10-15 00:19:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-10-15 00:19:23,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 8 letters. [2024-10-15 00:19:23,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:23,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 18 letters. Loop has 8 letters. [2024-10-15 00:19:23,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:23,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 16 letters. [2024-10-15 00:19:23,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:23,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2024-10-15 00:19:23,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:19:23,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 36 states and 45 transitions. [2024-10-15 00:19:23,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-15 00:19:23,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-15 00:19:23,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2024-10-15 00:19:23,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:19:23,555 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-15 00:19:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2024-10-15 00:19:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2024-10-15 00:19:23,556 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-10-15 00:19:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-10-15 00:19:23,557 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-10-15 00:19:23,557 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-10-15 00:19:23,557 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:19:23,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2024-10-15 00:19:23,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:19:23,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:23,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:23,558 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:23,558 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:19:23,558 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-10-15 00:19:23,558 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-10-15 00:19:23,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:23,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1819909431, now seen corresponding path program 1 times [2024-10-15 00:19:23,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:23,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261784576] [2024-10-15 00:19:23,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:23,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:23,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:23,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:23,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:23,590 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2024-10-15 00:19:23,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:23,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864965994] [2024-10-15 00:19:23,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:23,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:23,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:23,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:23,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:23,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1549642686, now seen corresponding path program 1 times [2024-10-15 00:19:23,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:23,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778138417] [2024-10-15 00:19:23,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:23,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:23,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:23,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:24,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-15 00:19:24,058 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:19:24,058 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:19:24,058 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:19:24,058 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:19:24,058 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:19:24,058 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:24,058 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:19:24,058 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:19:24,058 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration7_Lasso [2024-10-15 00:19:24,058 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:19:24,058 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:19:24,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:24,434 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:19:24,435 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:19:24,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:24,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:24,436 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-10-15 00:19:24,439 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-10-15 00:19:24,439 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-10-15 00:19:24,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:24,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:24,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:24,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:24,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:24,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:24,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:24,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:24,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:24,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:24,467 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-10-15 00:19:24,468 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-10-15 00:19:24,468 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-10-15 00:19:24,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:24,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:24,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:24,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:24,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:24,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:24,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:24,480 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:24,492 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-10-15 00:19:24,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:24,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:24,494 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-10-15 00:19:24,496 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-10-15 00:19:24,497 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-10-15 00:19:24,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:24,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:24,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:24,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:24,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:24,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:24,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:24,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:24,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:24,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:24,532 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-10-15 00:19:24,533 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-10-15 00:19:24,534 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-10-15 00:19:24,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:24,545 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-15 00:19:24,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:24,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:24,547 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-15 00:19:24,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:24,552 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:24,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:24,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:24,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:24,565 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-10-15 00:19:24,567 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-10-15 00:19:24,567 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-10-15 00:19:24,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:24,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:24,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:24,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:24,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:24,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:24,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:24,593 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-10-15 00:19:24,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:24,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:24,594 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-10-15 00:19:24,595 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-10-15 00:19:24,597 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-10-15 00:19:24,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:24,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:24,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:24,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:24,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:24,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:24,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:24,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:24,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:24,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:24,631 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-10-15 00:19:24,632 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-10-15 00:19:24,632 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-10-15 00:19:24,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:24,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:24,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:24,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:24,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:24,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:24,656 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:19:24,672 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-15 00:19:24,672 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-10-15 00:19:24,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:24,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:24,673 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-10-15 00:19:24,674 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-10-15 00:19:24,674 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:19:24,685 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-15 00:19:24,686 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:19:24,686 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-10-15 00:19:24,697 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-10-15 00:19:24,710 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-10-15 00:19:24,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:24,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:19:24,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:24,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:19:24,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:24,855 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-10-15 00:19:24,855 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-10-15 00:19:24,949 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-10-15 00:19:24,949 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-10-15 00:19:24,950 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-10-15 00:19:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2024-10-15 00:19:24,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 25 transitions. Stem has 12 letters. Loop has 3 letters. [2024-10-15 00:19:24,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:24,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 25 transitions. Stem has 15 letters. Loop has 3 letters. [2024-10-15 00:19:24,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:24,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 25 transitions. Stem has 12 letters. Loop has 6 letters. [2024-10-15 00:19:24,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:24,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2024-10-15 00:19:24,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:19:24,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 39 states and 49 transitions. [2024-10-15 00:19:24,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-15 00:19:24,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-15 00:19:24,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2024-10-15 00:19:24,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:19:24,953 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-10-15 00:19:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2024-10-15 00:19:24,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2024-10-15 00:19:24,955 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-10-15 00:19:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-10-15 00:19:24,955 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-15 00:19:24,955 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-15 00:19:24,956 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:19:24,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2024-10-15 00:19:24,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:19:24,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:24,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:24,957 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:24,957 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:19:24,957 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-10-15 00:19:24,957 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-10-15 00:19:24,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:24,957 INFO L85 PathProgramCache]: Analyzing trace with hash 742119463, now seen corresponding path program 2 times [2024-10-15 00:19:24,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:24,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872697719] [2024-10-15 00:19:24,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:24,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:24,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:24,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:24,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2024-10-15 00:19:24,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:24,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149299384] [2024-10-15 00:19:24,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:24,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:24,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:24,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:24,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:24,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2010678748, now seen corresponding path program 2 times [2024-10-15 00:19:24,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:24,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52469986] [2024-10-15 00:19:24,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:25,026 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-10-15 00:19:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:25,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:25,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:25,484 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:19:25,484 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:19:25,484 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:19:25,484 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:19:25,484 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:19:25,484 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,484 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:19:25,484 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:19:25,484 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration8_Lasso [2024-10-15 00:19:25,484 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:19:25,484 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:19:25,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:25,859 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:19:25,859 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:19:25,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:25,861 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-10-15 00:19:25,862 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-10-15 00:19:25,863 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-10-15 00:19:25,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:25,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:25,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:25,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:25,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:25,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:25,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:25,875 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:25,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-15 00:19:25,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:25,887 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-10-15 00:19:25,888 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-10-15 00:19:25,889 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-10-15 00:19:25,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:25,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:25,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:25,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:25,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:25,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:25,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:25,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-15 00:19:25,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:25,917 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-10-15 00:19:25,918 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-10-15 00:19:25,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-10-15 00:19:25,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:25,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:25,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:25,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:25,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:25,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:25,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:25,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:25,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-15 00:19:25,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:25,945 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-10-15 00:19:25,947 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-10-15 00:19:25,947 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-10-15 00:19:25,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:25,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:25,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:25,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:25,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:25,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:25,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:25,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:25,970 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-10-15 00:19:25,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:25,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:25,982 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-10-15 00:19:25,983 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-10-15 00:19:25,984 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-10-15 00:19:25,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:25,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:25,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:25,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:25,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:25,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:25,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:25,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:26,007 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-10-15 00:19:26,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:26,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:26,009 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-10-15 00:19:26,010 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-10-15 00:19:26,010 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-10-15 00:19:26,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:26,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:26,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:26,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:26,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:26,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:26,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:26,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:26,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-15 00:19:26,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:26,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:26,040 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-10-15 00:19:26,043 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-10-15 00:19:26,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-10-15 00:19:26,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:26,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:26,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:26,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:26,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:26,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:26,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:26,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:26,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-15 00:19:26,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:26,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:26,080 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-10-15 00:19:26,081 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-10-15 00:19:26,082 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-10-15 00:19:26,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:26,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:26,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:26,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:26,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:26,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:26,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:26,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-15 00:19:26,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:26,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:26,111 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-10-15 00:19:26,112 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-10-15 00:19:26,113 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-10-15 00:19:26,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:26,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:26,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:26,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:26,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:26,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:26,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:26,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:26,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:26,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:26,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:26,144 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-10-15 00:19:26,147 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-10-15 00:19:26,147 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-10-15 00:19:26,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:26,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:26,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:26,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:26,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:26,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:26,171 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:26,187 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-10-15 00:19:26,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:26,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:26,190 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-10-15 00:19:26,191 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-10-15 00:19:26,192 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-10-15 00:19:26,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:26,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:26,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:26,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:26,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:26,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:26,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:19:26,249 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2024-10-15 00:19:26,249 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-15 00:19:26,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:26,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:26,251 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-10-15 00:19:26,252 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-10-15 00:19:26,253 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:19:26,264 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-15 00:19:26,265 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:19:26,265 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-10-15 00:19:26,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-15 00:19:26,287 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2024-10-15 00:19:26,290 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:19:26,291 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:19:26,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:26,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:19:26,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:26,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:19:26,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:26,403 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-10-15 00:19:26,403 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-10-15 00:19:26,450 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-10-15 00:19:26,450 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-10-15 00:19:26,451 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-10-15 00:19:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-15 00:19:26,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2024-10-15 00:19:26,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:26,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 17 letters. Loop has 3 letters. [2024-10-15 00:19:26,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:26,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 14 letters. Loop has 6 letters. [2024-10-15 00:19:26,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:26,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2024-10-15 00:19:26,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:19:26,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 33 states and 41 transitions. [2024-10-15 00:19:26,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-15 00:19:26,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:19:26,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2024-10-15 00:19:26,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:19:26,453 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-10-15 00:19:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2024-10-15 00:19:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2024-10-15 00:19:26,455 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-10-15 00:19:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-10-15 00:19:26,455 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-15 00:19:26,455 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-15 00:19:26,455 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:19:26,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-10-15 00:19:26,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:19:26,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:26,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:26,456 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:26,456 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:19:26,457 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-10-15 00:19:26,457 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-10-15 00:19:26,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:26,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2059440754, now seen corresponding path program 1 times [2024-10-15 00:19:26,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:26,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356202946] [2024-10-15 00:19:26,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:26,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:19:26,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:26,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356202946] [2024-10-15 00:19:26,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356202946] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:19:26,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209237138] [2024-10-15 00:19:26,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:26,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:19:26,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:26,589 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-10-15 00:19:26,591 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-10-15 00:19:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:26,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:19:26,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:19:26,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:19:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:19:26,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209237138] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:19:26,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:19:26,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-15 00:19:26,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783342702] [2024-10-15 00:19:26,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:19:26,787 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:19:26,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:26,788 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2024-10-15 00:19:26,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:26,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623719787] [2024-10-15 00:19:26,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:26,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:26,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:26,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:26,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:26,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-15 00:19:26,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-10-15 00:19:26,843 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-10-15 00:19:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:26,924 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-10-15 00:19:26,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2024-10-15 00:19:26,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:19:26,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 26 states and 31 transitions. [2024-10-15 00:19:26,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:19:26,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:19:26,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2024-10-15 00:19:26,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:19:26,927 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-10-15 00:19:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2024-10-15 00:19:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-10-15 00:19:26,928 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-10-15 00:19:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-10-15 00:19:26,928 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-15 00:19:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 00:19:26,931 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-15 00:19:26,932 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:19:26,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2024-10-15 00:19:26,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:19:26,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:26,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:26,933 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:26,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:19:26,934 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-10-15 00:19:26,934 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-10-15 00:19:26,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1355850988, now seen corresponding path program 2 times [2024-10-15 00:19:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:26,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440689255] [2024-10-15 00:19:26,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:26,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:27,043 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-10-15 00:19:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:27,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440689255] [2024-10-15 00:19:27,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440689255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:19:27,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785979588] [2024-10-15 00:19:27,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:19:27,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:19:27,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:27,094 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-10-15 00:19:27,095 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-10-15 00:19:27,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:19:27,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:19:27,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 00:19:27,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:27,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:19:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:27,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785979588] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:19:27,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:19:27,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-10-15 00:19:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926599801] [2024-10-15 00:19:27,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:19:27,329 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:19:27,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:27,330 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2024-10-15 00:19:27,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:27,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422738370] [2024-10-15 00:19:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:27,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:27,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:27,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:27,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:27,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-15 00:19:27,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-15 00:19:27,386 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-10-15 00:19:27,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:27,563 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-10-15 00:19:27,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 47 transitions. [2024-10-15 00:19:27,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:19:27,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 47 transitions. [2024-10-15 00:19:27,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-15 00:19:27,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:19:27,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 47 transitions. [2024-10-15 00:19:27,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:19:27,564 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-15 00:19:27,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 47 transitions. [2024-10-15 00:19:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2024-10-15 00:19:27,565 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-10-15 00:19:27,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-15 00:19:27,566 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-15 00:19:27,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 00:19:27,568 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-15 00:19:27,569 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 00:19:27,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2024-10-15 00:19:27,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:19:27,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:27,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:27,570 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:27,570 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:19:27,570 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-10-15 00:19:27,570 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-10-15 00:19:27,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:27,570 INFO L85 PathProgramCache]: Analyzing trace with hash 197123111, now seen corresponding path program 3 times [2024-10-15 00:19:27,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:27,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181014818] [2024-10-15 00:19:27,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:27,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:27,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:27,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:27,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2024-10-15 00:19:27,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:27,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191209859] [2024-10-15 00:19:27,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:27,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:27,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:27,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:27,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:27,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1274344996, now seen corresponding path program 1 times [2024-10-15 00:19:27,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:27,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778648468] [2024-10-15 00:19:27,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:27,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:27,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:27,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:28,605 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:19:28,605 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:19:28,605 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:19:28,606 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:19:28,606 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:19:28,606 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:28,606 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:19:28,606 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:19:28,606 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration11_Lasso [2024-10-15 00:19:28,606 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:19:28,606 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:19:28,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:28,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:29,002 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:19:29,002 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:19:29,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,004 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-10-15 00:19:29,005 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-10-15 00:19:29,005 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-10-15 00:19:29,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:29,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:29,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:29,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,028 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-10-15 00:19:29,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,030 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-10-15 00:19:29,030 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-10-15 00:19:29,031 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-10-15 00:19:29,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:29,045 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:29,047 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,058 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-10-15 00:19:29,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,059 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-10-15 00:19:29,060 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-10-15 00:19:29,061 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-10-15 00:19:29,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:29,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:29,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:29,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,082 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-10-15 00:19:29,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,084 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-10-15 00:19:29,085 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-10-15 00:19:29,085 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-10-15 00:19:29,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:29,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:29,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:29,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-15 00:19:29,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,110 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-10-15 00:19:29,110 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-10-15 00:19:29,111 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-10-15 00:19:29,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:29,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:29,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:29,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,132 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-10-15 00:19:29,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,134 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-10-15 00:19:29,134 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-10-15 00:19:29,135 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-10-15 00:19:29,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:29,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:29,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:29,146 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-15 00:19:29,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,158 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-10-15 00:19:29,170 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-10-15 00:19:29,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-10-15 00:19:29,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:29,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:29,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:29,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-15 00:19:29,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,195 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-10-15 00:19:29,195 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-10-15 00:19:29,196 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-10-15 00:19:29,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:29,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:29,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:29,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:29,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,220 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-10-15 00:19:29,221 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-10-15 00:19:29,221 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-10-15 00:19:29,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:29,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:29,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:29,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,243 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-10-15 00:19:29,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,244 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-10-15 00:19:29,245 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-10-15 00:19:29,246 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-10-15 00:19:29,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:29,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:29,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-10-15 00:19:29,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,271 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-10-15 00:19:29,272 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-10-15 00:19:29,273 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-10-15 00:19:29,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:29,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:29,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:29,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:29,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,296 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-10-15 00:19:29,297 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-10-15 00:19:29,298 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-10-15 00:19:29,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:29,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:29,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:29,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:29,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,321 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-10-15 00:19:29,322 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-10-15 00:19:29,326 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-10-15 00:19:29,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:29,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:29,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:29,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:29,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,350 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-10-15 00:19:29,351 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-10-15 00:19:29,351 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-10-15 00:19:29,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:29,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:29,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:29,363 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,373 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-10-15 00:19:29,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,375 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-10-15 00:19:29,375 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-10-15 00:19:29,376 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-10-15 00:19:29,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,386 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-15 00:19:29,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,388 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-15 00:19:29,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:29,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:29,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-10-15 00:19:29,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,407 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-10-15 00:19:29,408 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-10-15 00:19:29,410 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-10-15 00:19:29,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:29,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:29,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:29,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:29,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:29,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:29,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:19:29,457 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-15 00:19:29,457 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-15 00:19:29,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:29,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:29,459 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-10-15 00:19:29,460 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-10-15 00:19:29,461 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:19:29,471 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-15 00:19:29,471 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:19:29,471 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-10-15 00:19:29,482 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-10-15 00:19:29,492 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-10-15 00:19:29,494 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:19:29,494 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:19:29,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:29,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 00:19:29,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:29,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:19:29,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:29,666 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-10-15 00:19:29,666 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-10-15 00:19:29,712 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-10-15 00:19:29,712 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-10-15 00:19:29,713 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-10-15 00:19:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-15 00:19:29,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 25 letters. Loop has 3 letters. [2024-10-15 00:19:29,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:29,713 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:19:29,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:29,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 00:19:29,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:29,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:19:29,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:29,876 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-10-15 00:19:29,876 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-10-15 00:19:29,914 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-10-15 00:19:29,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-10-15 00:19:29,916 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-10-15 00:19:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-15 00:19:29,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 25 letters. Loop has 3 letters. [2024-10-15 00:19:29,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:29,916 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:19:29,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:29,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 00:19:29,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:30,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:19:30,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:30,080 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-10-15 00:19:30,080 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-10-15 00:19:30,127 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-10-15 00:19:30,127 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-10-15 00:19:30,127 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-10-15 00:19:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2024-10-15 00:19:30,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2024-10-15 00:19:30,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:30,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 28 letters. Loop has 3 letters. [2024-10-15 00:19:30,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:30,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 6 letters. [2024-10-15 00:19:30,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:30,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 59 transitions. [2024-10-15 00:19:30,129 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:19:30,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2024-10-15 00:19:30,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:19:30,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:19:30,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:19:30,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:30,129 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:19:30,130 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:19:30,130 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:19:30,130 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-15 00:19:30,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 00:19:30,130 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:19:30,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 00:19:30,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:19:30 BoogieIcfgContainer [2024-10-15 00:19:30,136 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:19:30,136 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:19:30,136 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:19:30,136 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:19:30,137 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:19:19" (3/4) ... [2024-10-15 00:19:30,138 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 00:19:30,139 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:19:30,139 INFO L158 Benchmark]: Toolchain (without parser) took 11195.30ms. Allocated memory was 178.3MB in the beginning and 264.2MB in the end (delta: 86.0MB). Free memory was 109.1MB in the beginning and 120.1MB in the end (delta: -11.0MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2024-10-15 00:19:30,139 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 78.6MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:19:30,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.03ms. Allocated memory is still 178.3MB. Free memory was 108.9MB in the beginning and 97.7MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 00:19:30,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.08ms. Allocated memory is still 178.3MB. Free memory was 97.7MB in the beginning and 96.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:19:30,140 INFO L158 Benchmark]: Boogie Preprocessor took 42.13ms. Allocated memory is still 178.3MB. Free memory was 96.3MB in the beginning and 94.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:19:30,140 INFO L158 Benchmark]: RCFGBuilder took 297.36ms. Allocated memory is still 178.3MB. Free memory was 94.4MB in the beginning and 148.7MB in the end (delta: -54.3MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2024-10-15 00:19:30,140 INFO L158 Benchmark]: BuchiAutomizer took 10587.52ms. Allocated memory was 178.3MB in the beginning and 264.2MB in the end (delta: 86.0MB). Free memory was 148.7MB in the beginning and 120.1MB in the end (delta: 28.6MB). Peak memory consumption was 115.6MB. Max. memory is 16.1GB. [2024-10-15 00:19:30,140 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 264.2MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:19:30,141 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.15ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 78.6MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.03ms. Allocated memory is still 178.3MB. Free memory was 108.9MB in the beginning and 97.7MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.08ms. Allocated memory is still 178.3MB. Free memory was 97.7MB in the beginning and 96.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.13ms. Allocated memory is still 178.3MB. Free memory was 96.3MB in the beginning and 94.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 297.36ms. Allocated memory is still 178.3MB. Free memory was 94.4MB in the beginning and 148.7MB in the end (delta: -54.3MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 10587.52ms. Allocated memory was 178.3MB in the beginning and 264.2MB in the end (delta: 86.0MB). Free memory was 148.7MB in the beginning and 120.1MB in the end (delta: 28.6MB). Peak memory consumption was 115.6MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 264.2MB. Free memory is still 120.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.5s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 8.7s. 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-10-15 00:19:30,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-10-15 00:19:30,363 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-10-15 00:19:30,562 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-10-15 00:19:30,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 00:19:30,964 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