./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 a046e57d 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:05:33,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:05:33,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 17:05:33,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:05:33,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:05:33,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:05:33,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:05:33,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:05:33,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:05:33,381 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:05:33,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:05:33,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:05:33,382 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:05:33,382 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:05:33,382 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:05:33,383 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:05:33,383 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:05:33,383 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:05:33,383 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:05:33,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:05:33,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:05:33,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:05:33,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:05:33,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:05:33,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:05:33,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:05:33,397 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:05:33,397 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:05:33,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:05:33,398 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:05:33,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:05:33,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:05:33,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:05:33,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:05:33,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:05:33,399 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:05:33,399 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-13 17:05:33,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:05:33,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:05:33,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:05:33,620 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:05:33,621 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:05:33,622 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-13 17:05:34,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:05:35,082 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:05:35,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2024-10-13 17:05:35,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7593aacff/436fbd4cf7c24c8590ab2bbdf1d9939c/FLAGf224edeed [2024-10-13 17:05:35,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7593aacff/436fbd4cf7c24c8590ab2bbdf1d9939c [2024-10-13 17:05:35,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:05:35,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:05:35,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:05:35,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:05:35,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:05:35,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:05:35" (1/1) ... [2024-10-13 17:05:35,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b18268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35, skipping insertion in model container [2024-10-13 17:05:35,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:05:35" (1/1) ... [2024-10-13 17:05:35,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:05:35,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:05:35,662 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:05:35,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:05:35,687 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:05:35,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35 WrapperNode [2024-10-13 17:05:35,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:05:35,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:05:35,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:05:35,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:05:35,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35" (1/1) ... [2024-10-13 17:05:35,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35" (1/1) ... [2024-10-13 17:05:35,713 INFO L138 Inliner]: procedures = 11, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2024-10-13 17:05:35,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:05:35,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:05:35,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:05:35,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:05:35,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35" (1/1) ... [2024-10-13 17:05:35,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35" (1/1) ... [2024-10-13 17:05:35,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35" (1/1) ... [2024-10-13 17:05:35,734 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-13 17:05:35,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35" (1/1) ... [2024-10-13 17:05:35,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35" (1/1) ... [2024-10-13 17:05:35,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35" (1/1) ... [2024-10-13 17:05:35,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35" (1/1) ... [2024-10-13 17:05:35,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35" (1/1) ... [2024-10-13 17:05:35,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35" (1/1) ... [2024-10-13 17:05:35,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:05:35,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:05:35,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:05:35,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:05:35,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35" (1/1) ... [2024-10-13 17:05:35,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:35,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:35,772 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-13 17:05:35,777 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-13 17:05:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 17:05:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 17:05:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:05:35,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:05:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 17:05:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2024-10-13 17:05:35,812 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2024-10-13 17:05:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 17:05:35,867 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:05:35,869 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:05:35,996 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 17:05:35,996 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:05:36,005 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:05:36,005 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 17:05:36,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:05:36 BoogieIcfgContainer [2024-10-13 17:05:36,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:05:36,007 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:05:36,007 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:05:36,011 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:05:36,012 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:05:36,012 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:05:35" (1/3) ... [2024-10-13 17:05:36,013 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dda0365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:05:36, skipping insertion in model container [2024-10-13 17:05:36,013 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:05:36,013 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:35" (2/3) ... [2024-10-13 17:05:36,013 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dda0365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:05:36, skipping insertion in model container [2024-10-13 17:05:36,013 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:05:36,013 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:05:36" (3/3) ... [2024-10-13 17:05:36,015 INFO L332 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive.i [2024-10-13 17:05:36,064 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:05:36,065 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:05:36,065 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:05:36,066 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:05:36,066 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:05:36,066 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:05:36,066 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:05:36,067 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:05:36,071 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-13 17:05:36,093 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-13 17:05:36,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:36,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:36,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-13 17:05:36,098 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:05:36,098 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:05:36,098 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-13 17:05:36,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-13 17:05:36,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:36,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:36,100 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-13 17:05:36,100 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:05:36,108 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-13 17:05:36,109 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-13 17:05:36,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:36,115 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-10-13 17:05:36,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:36,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913019415] [2024-10-13 17:05:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:36,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:36,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:36,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:36,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:36,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2024-10-13 17:05:36,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:36,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319751223] [2024-10-13 17:05:36,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:36,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:36,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:36,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:36,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:36,239 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2024-10-13 17:05:36,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:36,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397666506] [2024-10-13 17:05:36,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:36,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:36,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:36,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:36,519 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:05:36,520 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:05:36,520 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:05:36,521 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:05:36,521 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:05:36,521 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:36,521 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:05:36,521 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:05:36,521 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration1_Lasso [2024-10-13 17:05:36,522 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:05:36,522 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:05:36,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:36,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:36,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:36,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:36,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:36,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:36,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:36,825 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:05:36,828 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:05:36,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:36,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:36,832 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-13 17:05:36,833 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-13 17:05:36,835 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-13 17:05:36,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:36,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:36,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:36,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:36,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:36,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:36,889 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:05:36,916 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-13 17:05:36,917 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-13 17:05:36,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:36,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:36,944 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-13 17:05:36,979 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-13 17:05:36,982 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:05:36,996 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:05:36,997 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:05:36,997 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-13 17:05:37,010 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-13 17:05:37,014 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-10-13 17:05:37,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:37,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:05:37,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:37,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:05:37,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:37,096 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-13 17:05:37,145 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-13 17:05:37,147 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-13 17:05:37,191 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-13 17:05:37,194 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-13 17:05:37,198 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-13 17:05:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2024-10-13 17:05:37,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2024-10-13 17:05:37,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:37,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2024-10-13 17:05:37,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:37,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2024-10-13 17:05:37,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:37,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2024-10-13 17:05:37,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-13 17:05:37,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 15 states and 20 transitions. [2024-10-13 17:05:37,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-13 17:05:37,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-13 17:05:37,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2024-10-13 17:05:37,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:37,217 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-13 17:05:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2024-10-13 17:05:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-13 17:05:37,237 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-13 17:05:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-10-13 17:05:37,239 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-13 17:05:37,239 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-13 17:05:37,240 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:05:37,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2024-10-13 17:05:37,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-13 17:05:37,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:37,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:37,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:05:37,242 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:05:37,242 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-13 17:05:37,242 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-13 17:05:37,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:37,245 INFO L85 PathProgramCache]: Analyzing trace with hash 889572457, now seen corresponding path program 1 times [2024-10-13 17:05:37,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:37,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333757237] [2024-10-13 17:05:37,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:37,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:37,349 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-13 17:05:37,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:37,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333757237] [2024-10-13 17:05:37,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333757237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:05:37,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:05:37,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:05:37,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066159163] [2024-10-13 17:05:37,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:05:37,355 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:05:37,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:37,356 INFO L85 PathProgramCache]: Analyzing trace with hash 54535472, now seen corresponding path program 1 times [2024-10-13 17:05:37,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:37,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833269390] [2024-10-13 17:05:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:37,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:37,370 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-13 17:05:37,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:37,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833269390] [2024-10-13 17:05:37,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833269390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:05:37,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:05:37,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 17:05:37,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365435394] [2024-10-13 17:05:37,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:05:37,372 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:05:37,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:37,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 17:05:37,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 17:05:37,375 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-13 17:05:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:37,380 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2024-10-13 17:05:37,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2024-10-13 17:05:37,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-13 17:05:37,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2024-10-13 17:05:37,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-13 17:05:37,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-13 17:05:37,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2024-10-13 17:05:37,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:37,382 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-13 17:05:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2024-10-13 17:05:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-13 17:05:37,387 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-13 17:05:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-10-13 17:05:37,388 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-13 17:05:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 17:05:37,388 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-13 17:05:37,388 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:05:37,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2024-10-13 17:05:37,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-13 17:05:37,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:37,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:37,391 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:05:37,391 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:05:37,391 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-13 17:05:37,391 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-13 17:05:37,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:37,392 INFO L85 PathProgramCache]: Analyzing trace with hash 889572457, now seen corresponding path program 2 times [2024-10-13 17:05:37,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:37,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720379513] [2024-10-13 17:05:37,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:37,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:37,459 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-13 17:05:37,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:37,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720379513] [2024-10-13 17:05:37,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720379513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:05:37,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:05:37,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:05:37,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108221182] [2024-10-13 17:05:37,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:05:37,460 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:05:37,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:37,461 INFO L85 PathProgramCache]: Analyzing trace with hash 54524901, now seen corresponding path program 1 times [2024-10-13 17:05:37,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:37,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32610040] [2024-10-13 17:05:37,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:37,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:37,492 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-13 17:05:37,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:37,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32610040] [2024-10-13 17:05:37,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32610040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:05:37,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:05:37,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:05:37,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081766636] [2024-10-13 17:05:37,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:05:37,493 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:05:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:37,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:05:37,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:05:37,494 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-13 17:05:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:37,503 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2024-10-13 17:05:37,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2024-10-13 17:05:37,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:37,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2024-10-13 17:05:37,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-13 17:05:37,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 17:05:37,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2024-10-13 17:05:37,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:37,505 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-13 17:05:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2024-10-13 17:05:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-13 17:05:37,506 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-13 17:05:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-13 17:05:37,507 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-13 17:05:37,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:05:37,508 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-13 17:05:37,508 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:05:37,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-10-13 17:05:37,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:37,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:37,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:37,509 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:05:37,509 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:37,509 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-13 17:05:37,509 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-13 17:05:37,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:37,510 INFO L85 PathProgramCache]: Analyzing trace with hash 889572457, now seen corresponding path program 3 times [2024-10-13 17:05:37,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:37,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658246997] [2024-10-13 17:05:37,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:37,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:37,548 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-13 17:05:37,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:37,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658246997] [2024-10-13 17:05:37,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658246997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:05:37,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:05:37,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:05:37,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040176963] [2024-10-13 17:05:37,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:05:37,549 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:05:37,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:37,550 INFO L85 PathProgramCache]: Analyzing trace with hash 903326980, now seen corresponding path program 1 times [2024-10-13 17:05:37,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:37,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529984741] [2024-10-13 17:05:37,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:37,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:37,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:37,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:38,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:38,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:05:38,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:05:38,053 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-13 17:05:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:38,061 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-10-13 17:05:38,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2024-10-13 17:05:38,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:38,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2024-10-13 17:05:38,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-13 17:05:38,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 17:05:38,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2024-10-13 17:05:38,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:38,062 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-13 17:05:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2024-10-13 17:05:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-10-13 17:05:38,063 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-13 17:05:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-10-13 17:05:38,064 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-13 17:05:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:05:38,065 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-13 17:05:38,065 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 17:05:38,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2024-10-13 17:05:38,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:38,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:38,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:38,066 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:38,066 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:38,066 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-13 17:05:38,066 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-13 17:05:38,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:38,067 INFO L85 PathProgramCache]: Analyzing trace with hash 182329415, now seen corresponding path program 1 times [2024-10-13 17:05:38,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:38,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418297120] [2024-10-13 17:05:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:38,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:38,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:38,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:38,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:38,086 INFO L85 PathProgramCache]: Analyzing trace with hash 903326980, now seen corresponding path program 2 times [2024-10-13 17:05:38,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:38,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213317302] [2024-10-13 17:05:38,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:38,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:38,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:38,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:38,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:38,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1689508022, now seen corresponding path program 1 times [2024-10-13 17:05:38,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:38,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051361015] [2024-10-13 17:05:38,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:38,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:38,214 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-13 17:05:38,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:38,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051361015] [2024-10-13 17:05:38,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051361015] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:05:38,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196033278] [2024-10-13 17:05:38,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:38,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:05:38,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:38,217 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-13 17:05:38,218 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-13 17:05:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:38,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:05:38,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:38,323 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-13 17:05:38,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:05:38,386 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-13 17:05:38,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196033278] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:05:38,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:05:38,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-13 17:05:38,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024169247] [2024-10-13 17:05:38,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:05:38,494 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-13 17:05:38,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:38,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 17:05:38,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-13 17:05:38,720 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-13 17:05:38,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:38,778 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-10-13 17:05:38,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2024-10-13 17:05:38,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:38,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 22 transitions. [2024-10-13 17:05:38,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-13 17:05:38,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 17:05:38,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-10-13 17:05:38,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:38,782 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-13 17:05:38,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-10-13 17:05:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-10-13 17:05:38,783 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-13 17:05:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-10-13 17:05:38,784 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-13 17:05:38,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 17:05:38,784 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-13 17:05:38,784 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 17:05:38,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2024-10-13 17:05:38,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:38,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:38,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:38,785 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:38,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:38,785 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-13 17:05:38,785 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-13 17:05:38,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash -873401179, now seen corresponding path program 2 times [2024-10-13 17:05:38,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:38,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901248823] [2024-10-13 17:05:38,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:38,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:38,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:38,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:38,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash 903326980, now seen corresponding path program 3 times [2024-10-13 17:05:38,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:38,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723030257] [2024-10-13 17:05:38,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:38,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:38,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:38,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:38,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:38,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1198243240, now seen corresponding path program 2 times [2024-10-13 17:05:38,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:38,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836900245] [2024-10-13 17:05:38,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:38,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:38,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:38,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:39,366 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:05:39,366 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:05:39,366 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:05:39,366 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:05:39,366 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:05:39,366 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:39,366 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:05:39,366 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:05:39,366 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration6_Lasso [2024-10-13 17:05:39,366 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:05:39,367 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:05:39,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:39,792 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:05:39,792 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:05:39,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:39,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:39,795 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-13 17:05:39,796 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-13 17:05:39,797 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-13 17:05:39,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:39,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:39,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:39,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:39,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:39,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:39,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:39,811 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:39,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:39,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:39,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:39,827 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-13 17:05:39,832 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-13 17:05:39,834 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-13 17:05:39,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:39,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:39,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:39,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:39,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:39,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:39,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:39,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:39,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:39,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:39,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:39,860 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-13 17:05:39,861 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-13 17:05:39,862 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-13 17:05:39,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:39,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:39,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:39,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:39,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:39,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:39,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:39,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:39,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:39,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:39,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:39,888 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-13 17:05:39,889 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-13 17:05:39,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-13 17:05:39,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:39,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:39,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:39,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:39,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:39,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:39,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:39,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:39,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-13 17:05:39,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:39,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:39,920 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-13 17:05:39,925 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-13 17:05:39,926 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-13 17:05:39,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:39,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:39,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:39,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:39,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:39,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:39,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:39,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:39,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:39,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:39,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:39,956 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-13 17:05:39,957 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-13 17:05:39,959 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-13 17:05:39,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:39,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:39,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:39,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:39,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:39,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:39,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:39,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:39,981 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-13 17:05:39,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:39,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:39,986 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-13 17:05:39,990 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-13 17:05:39,991 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-13 17:05:40,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:40,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:40,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:40,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:40,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:40,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:40,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:40,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:40,015 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-13 17:05:40,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:40,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:40,017 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-13 17:05:40,018 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-13 17:05:40,019 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-13 17:05:40,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:40,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:40,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:40,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:40,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:40,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:40,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:40,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:40,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:40,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:40,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:40,045 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-13 17:05:40,046 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-13 17:05:40,048 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-13 17:05:40,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:40,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:40,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:40,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:40,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:40,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:40,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:40,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:40,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-13 17:05:40,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:40,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:40,078 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-13 17:05:40,079 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-13 17:05:40,080 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-13 17:05:40,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:40,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:40,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:40,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:40,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:40,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:40,102 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:05:40,122 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-13 17:05:40,122 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-13 17:05:40,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:40,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:40,124 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-13 17:05:40,125 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-13 17:05:40,126 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:05:40,136 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:05:40,137 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:05:40,137 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-13 17:05:40,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:40,157 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2024-10-13 17:05:40,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:40,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:05:40,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:40,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:05:40,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:40,311 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-13 17:05:40,312 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-13 17:05:40,312 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-13 17:05:40,384 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-13 17:05:40,385 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-13 17:05:40,386 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-13 17:05:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-10-13 17:05:40,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 8 letters. [2024-10-13 17:05:40,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:40,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 18 letters. Loop has 8 letters. [2024-10-13 17:05:40,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:40,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 16 letters. [2024-10-13 17:05:40,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:40,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2024-10-13 17:05:40,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-13 17:05:40,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 36 states and 45 transitions. [2024-10-13 17:05:40,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-13 17:05:40,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-13 17:05:40,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2024-10-13 17:05:40,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:05:40,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-13 17:05:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2024-10-13 17:05:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2024-10-13 17:05:40,390 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-13 17:05:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-10-13 17:05:40,390 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-10-13 17:05:40,390 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-10-13 17:05:40,390 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 17:05:40,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2024-10-13 17:05:40,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:05:40,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:40,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:40,391 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:40,391 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:05:40,391 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-13 17:05:40,391 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-13 17:05:40,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:40,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1819909431, now seen corresponding path program 1 times [2024-10-13 17:05:40,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:40,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789537179] [2024-10-13 17:05:40,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:40,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:40,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:40,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:40,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:40,416 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2024-10-13 17:05:40,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:40,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7769365] [2024-10-13 17:05:40,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:40,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:40,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:40,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:40,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:40,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1549642686, now seen corresponding path program 1 times [2024-10-13 17:05:40,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:40,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598541868] [2024-10-13 17:05:40,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:40,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:40,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:40,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:40,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:41,240 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:05:41,241 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:05:41,241 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:05:41,241 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:05:41,241 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:05:41,241 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:41,241 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:05:41,241 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:05:41,241 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration7_Lasso [2024-10-13 17:05:41,241 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:05:41,241 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:05:41,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:41,637 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:05:41,637 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:05:41,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:41,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:41,641 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-13 17:05:41,642 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-13 17:05:41,644 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-13 17:05:41,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:41,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:41,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:41,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:41,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:41,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:41,661 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:41,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-13 17:05:41,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:41,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:41,676 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-13 17:05:41,677 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-13 17:05:41,679 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-13 17:05:41,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:41,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:41,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:41,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:41,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:41,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:41,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:41,690 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:41,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:41,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:41,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:41,709 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-13 17:05:41,710 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-13 17:05:41,711 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-13 17:05:41,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:41,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:41,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:41,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:41,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:41,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:41,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:41,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-13 17:05:41,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:41,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:41,744 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-13 17:05:41,746 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-13 17:05:41,746 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-13 17:05:41,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:41,756 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-13 17:05:41,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:41,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:41,758 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-13 17:05:41,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:41,763 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:41,773 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-13 17:05:41,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:41,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:41,774 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-13 17:05:41,776 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-13 17:05:41,781 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-13 17:05:41,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:41,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:41,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:41,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:41,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:41,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:41,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:41,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:41,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:41,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:41,812 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-13 17:05:41,813 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-13 17:05:41,814 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-13 17:05:41,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:41,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:41,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:41,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:41,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:41,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:41,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:41,843 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-13 17:05:41,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:41,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:41,845 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-13 17:05:41,846 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-13 17:05:41,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:41,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:41,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:41,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:41,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:41,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:41,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:41,870 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:05:41,899 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-13 17:05:41,899 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-10-13 17:05:41,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:41,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:41,902 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-13 17:05:41,903 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-13 17:05:41,904 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:05:41,914 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-13 17:05:41,914 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:05:41,914 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-13 17:05:41,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-13 17:05:41,951 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-10-13 17:05:41,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:41,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 17:05:41,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:42,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:05:42,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:42,076 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-13 17:05:42,076 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-13 17:05:42,076 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-13 17:05:42,166 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-13 17:05:42,167 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-13 17:05:42,167 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-13 17:05:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2024-10-13 17:05:42,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 25 transitions. Stem has 12 letters. Loop has 3 letters. [2024-10-13 17:05:42,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:42,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 25 transitions. Stem has 15 letters. Loop has 3 letters. [2024-10-13 17:05:42,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:42,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 25 transitions. Stem has 12 letters. Loop has 6 letters. [2024-10-13 17:05:42,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:42,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2024-10-13 17:05:42,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:05:42,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 39 states and 49 transitions. [2024-10-13 17:05:42,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-13 17:05:42,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-13 17:05:42,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2024-10-13 17:05:42,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:05:42,171 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-10-13 17:05:42,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2024-10-13 17:05:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2024-10-13 17:05:42,174 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-13 17:05:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-10-13 17:05:42,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-13 17:05:42,174 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-13 17:05:42,174 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 17:05:42,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2024-10-13 17:05:42,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:05:42,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:42,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:42,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:42,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:05:42,176 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-13 17:05:42,176 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-13 17:05:42,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:42,177 INFO L85 PathProgramCache]: Analyzing trace with hash 742119463, now seen corresponding path program 2 times [2024-10-13 17:05:42,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:42,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606408085] [2024-10-13 17:05:42,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:42,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:42,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:42,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:42,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:42,196 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2024-10-13 17:05:42,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:42,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119693357] [2024-10-13 17:05:42,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:42,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:42,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:42,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:42,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2010678748, now seen corresponding path program 2 times [2024-10-13 17:05:42,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:42,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976061509] [2024-10-13 17:05:42,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:42,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:42,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:42,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:42,409 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-13 17:05:42,679 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:05:42,679 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:05:42,679 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:05:42,679 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:05:42,680 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:05:42,680 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:42,680 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:05:42,680 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:05:42,680 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration8_Lasso [2024-10-13 17:05:42,680 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:05:42,680 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:05:42,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:42,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:43,060 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:05:43,061 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:05:43,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,067 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-13 17:05:43,068 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-13 17:05:43,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-13 17:05:43,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:43,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:43,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:43,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:43,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:43,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:43,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:43,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:43,091 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-13 17:05:43,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,093 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-13 17:05:43,094 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-13 17:05:43,096 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-13 17:05:43,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:43,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:43,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:43,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:43,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:43,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:43,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:43,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:43,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,123 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-13 17:05:43,125 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-13 17:05:43,125 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-13 17:05:43,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:43,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:43,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:43,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:43,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:43,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:43,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:43,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:43,147 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-13 17:05:43,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,149 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-13 17:05:43,150 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-13 17:05:43,151 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-13 17:05:43,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:43,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:43,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:43,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:43,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:43,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:43,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:43,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:43,175 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-13 17:05:43,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,176 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-13 17:05:43,177 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-13 17:05:43,179 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-13 17:05:43,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:43,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:43,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:43,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:43,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:43,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:43,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:43,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:43,201 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-13 17:05:43,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,203 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-13 17:05:43,204 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-13 17:05:43,204 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-13 17:05:43,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:43,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:43,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:43,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:43,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:43,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:43,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:43,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:43,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:43,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,228 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-13 17:05:43,229 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-13 17:05:43,230 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-13 17:05:43,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:43,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:43,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:43,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:43,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:43,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:43,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:43,242 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:43,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:43,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,254 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-13 17:05:43,255 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-13 17:05:43,256 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-13 17:05:43,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:43,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:43,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:43,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:43,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:43,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:43,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:43,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:43,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,281 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-13 17:05:43,283 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-13 17:05:43,285 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-13 17:05:43,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:43,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:43,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:43,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:43,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:43,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:43,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:43,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:43,311 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-13 17:05:43,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,312 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-13 17:05:43,313 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-13 17:05:43,314 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-13 17:05:43,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:43,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:43,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:43,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:43,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:43,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:43,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:43,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-13 17:05:43,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,342 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-13 17:05:43,343 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-13 17:05:43,344 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-13 17:05:43,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:43,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:43,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:43,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:43,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:43,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:43,366 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:05:43,392 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2024-10-13 17:05:43,392 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-13 17:05:43,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:43,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,394 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-13 17:05:43,395 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-13 17:05:43,395 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:05:43,406 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-13 17:05:43,406 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:05:43,406 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-13 17:05:43,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:43,427 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2024-10-13 17:05:43,429 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-13 17:05:43,429 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-13 17:05:43,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:43,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 17:05:43,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:43,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:05:43,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:43,574 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-13 17:05:43,576 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-13 17:05:43,576 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-13 17:05:43,635 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-13 17:05:43,635 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-13 17:05:43,636 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-13 17:05:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-13 17:05:43,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2024-10-13 17:05:43,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:43,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 17 letters. Loop has 3 letters. [2024-10-13 17:05:43,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:43,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 14 letters. Loop has 6 letters. [2024-10-13 17:05:43,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:43,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2024-10-13 17:05:43,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:05:43,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 33 states and 41 transitions. [2024-10-13 17:05:43,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-13 17:05:43,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 17:05:43,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2024-10-13 17:05:43,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:05:43,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-10-13 17:05:43,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2024-10-13 17:05:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2024-10-13 17:05:43,639 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-13 17:05:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-10-13 17:05:43,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-13 17:05:43,639 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-13 17:05:43,639 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-13 17:05:43,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-10-13 17:05:43,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:05:43,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:43,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:43,645 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:43,645 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:05:43,645 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-13 17:05:43,646 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-13 17:05:43,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:43,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2059440754, now seen corresponding path program 1 times [2024-10-13 17:05:43,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:43,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698411189] [2024-10-13 17:05:43,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:43,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:43,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-13 17:05:43,907 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-13 17:05:43,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:43,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698411189] [2024-10-13 17:05:43,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698411189] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:05:43,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407215494] [2024-10-13 17:05:43,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:43,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:05:43,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:43,913 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-13 17:05:43,914 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-13 17:05:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:43,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 17:05:43,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:44,116 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-13 17:05:44,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:05:44,190 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-13 17:05:44,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407215494] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:05:44,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:05:44,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-13 17:05:44,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045535958] [2024-10-13 17:05:44,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:05:44,191 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:05:44,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2024-10-13 17:05:44,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:44,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067094677] [2024-10-13 17:05:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:44,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:44,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:44,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:44,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:44,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 17:05:44,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-10-13 17:05:44,296 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-13 17:05:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:44,397 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-10-13 17:05:44,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2024-10-13 17:05:44,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:05:44,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 26 states and 31 transitions. [2024-10-13 17:05:44,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:05:44,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-13 17:05:44,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2024-10-13 17:05:44,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:05:44,399 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-10-13 17:05:44,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2024-10-13 17:05:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-10-13 17:05:44,401 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-13 17:05:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-10-13 17:05:44,401 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-13 17:05:44,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 17:05:44,403 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-13 17:05:44,403 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-13 17:05:44,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2024-10-13 17:05:44,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:05:44,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:44,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:44,403 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:44,403 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:05:44,404 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-13 17:05:44,404 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-13 17:05:44,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1355850988, now seen corresponding path program 2 times [2024-10-13 17:05:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:44,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978177075] [2024-10-13 17:05:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:44,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:44,577 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-13 17:05:44,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:44,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978177075] [2024-10-13 17:05:44,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978177075] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:05:44,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879611076] [2024-10-13 17:05:44,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 17:05:44,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:05:44,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:44,580 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-13 17:05:44,582 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-13 17:05:44,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 17:05:44,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:05:44,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 17:05:44,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:44,782 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-13 17:05:44,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:05:44,942 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-13 17:05:44,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879611076] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:05:44,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:05:44,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-10-13 17:05:44,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057445324] [2024-10-13 17:05:44,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:05:44,943 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:05:44,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:44,943 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2024-10-13 17:05:44,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:44,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605681097] [2024-10-13 17:05:44,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:44,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:44,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:44,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:45,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:45,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 17:05:45,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-13 17:05:45,043 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-13 17:05:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:45,212 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-10-13 17:05:45,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 47 transitions. [2024-10-13 17:05:45,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:05:45,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 47 transitions. [2024-10-13 17:05:45,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-13 17:05:45,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:05:45,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 47 transitions. [2024-10-13 17:05:45,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:05:45,214 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-13 17:05:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 47 transitions. [2024-10-13 17:05:45,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2024-10-13 17:05:45,215 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-13 17:05:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-13 17:05:45,215 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-13 17:05:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 17:05:45,223 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-13 17:05:45,223 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-13 17:05:45,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2024-10-13 17:05:45,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:05:45,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:45,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:45,224 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:45,224 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:05:45,224 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-13 17:05:45,224 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-13 17:05:45,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash 197123111, now seen corresponding path program 3 times [2024-10-13 17:05:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:45,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236623491] [2024-10-13 17:05:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:45,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:45,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:45,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2024-10-13 17:05:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:45,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849663205] [2024-10-13 17:05:45,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:45,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:45,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:45,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:45,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:45,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1274344996, now seen corresponding path program 1 times [2024-10-13 17:05:45,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:45,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917518615] [2024-10-13 17:05:45,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:45,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:45,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:45,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:46,551 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:05:46,552 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:05:46,552 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:05:46,552 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:05:46,552 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:05:46,552 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:46,552 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:05:46,552 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:05:46,552 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration11_Lasso [2024-10-13 17:05:46,552 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:05:46,552 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:05:46,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:46,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:47,077 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:05:47,077 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:05:47,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,079 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-13 17:05:47,080 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-13 17:05:47,081 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-13 17:05:47,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:47,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:47,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:47,093 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,103 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-13 17:05:47,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,106 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-13 17:05:47,106 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-13 17:05:47,107 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-13 17:05:47,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:47,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:47,121 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,132 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-13 17:05:47,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,134 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-13 17:05:47,136 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-13 17:05:47,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:47,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:47,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:47,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:47,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,161 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-13 17:05:47,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,163 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-13 17:05:47,164 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-13 17:05:47,165 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-13 17:05:47,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:47,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:47,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:47,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:47,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,189 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-13 17:05:47,190 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-13 17:05:47,191 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-13 17:05:47,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:47,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:47,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:47,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,214 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-13 17:05:47,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,216 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-13 17:05:47,217 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-13 17:05:47,218 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-13 17:05:47,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:47,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:47,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:47,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,241 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-13 17:05:47,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,243 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-13 17:05:47,246 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-13 17:05:47,247 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-13 17:05:47,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:47,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:47,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:47,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:47,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,281 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-13 17:05:47,282 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-13 17:05:47,283 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-13 17:05:47,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:47,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:47,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:47,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,305 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-13 17:05:47,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,307 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-13 17:05:47,309 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-13 17:05:47,310 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-13 17:05:47,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:47,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:47,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:47,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,333 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-13 17:05:47,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,335 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-13 17:05:47,336 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-13 17:05:47,337 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-13 17:05:47,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:47,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:47,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,362 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-13 17:05:47,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,366 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-13 17:05:47,368 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-13 17:05:47,369 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-13 17:05:47,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:47,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:47,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:47,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-13 17:05:47,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,393 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-13 17:05:47,394 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-13 17:05:47,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:47,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:47,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:47,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:47,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-13 17:05:47,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,419 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-13 17:05:47,420 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-13 17:05:47,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:47,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:47,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:47,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:47,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-13 17:05:47,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,445 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-13 17:05:47,445 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-13 17:05:47,446 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-13 17:05:47,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:47,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:47,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:47,458 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:47,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,470 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-13 17:05:47,471 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-13 17:05:47,476 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-13 17:05:47,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,487 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-13 17:05:47,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,490 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-13 17:05:47,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:47,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:47,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:47,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,512 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-13 17:05:47,514 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-13 17:05:47,515 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-13 17:05:47,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:47,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:47,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:47,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:47,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:47,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:47,551 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:05:47,585 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-13 17:05:47,586 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-13 17:05:47,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:47,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:47,588 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-13 17:05:47,589 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-13 17:05:47,589 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:05:47,600 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-13 17:05:47,600 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:05:47,600 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-13 17:05:47,611 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-13 17:05:47,618 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-10-13 17:05:47,620 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-13 17:05:47,620 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-13 17:05:47,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:47,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 17:05:47,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:47,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:05:47,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:47,864 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-13 17:05:47,864 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-13 17:05:47,864 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-13 17:05:47,920 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-13 17:05:47,920 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-13 17:05:47,921 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-13 17:05:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-13 17:05:47,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 25 letters. Loop has 3 letters. [2024-10-13 17:05:47,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:47,923 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:05:47,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:47,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 17:05:47,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:48,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:05:48,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:48,070 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-13 17:05:48,071 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-13 17:05:48,071 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-13 17:05:48,110 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-13 17:05:48,110 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-13 17:05:48,110 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-13 17:05:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-13 17:05:48,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 25 letters. Loop has 3 letters. [2024-10-13 17:05:48,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:48,111 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:05:48,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:48,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 17:05:48,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:48,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:05:48,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:48,289 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-13 17:05:48,290 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-13 17:05:48,291 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-13 17:05:48,337 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-13 17:05:48,338 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-13 17:05:48,338 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-13 17:05:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2024-10-13 17:05:48,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2024-10-13 17:05:48,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:48,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 28 letters. Loop has 3 letters. [2024-10-13 17:05:48,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:48,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 6 letters. [2024-10-13 17:05:48,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:48,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 59 transitions. [2024-10-13 17:05:48,339 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:05:48,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2024-10-13 17:05:48,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-13 17:05:48,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-13 17:05:48,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-13 17:05:48,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:48,339 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:05:48,339 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:05:48,339 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:05:48,340 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-13 17:05:48,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-13 17:05:48,340 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:05:48,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-13 17:05:48,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 05:05:48 BoogieIcfgContainer [2024-10-13 17:05:48,354 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 17:05:48,354 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 17:05:48,354 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 17:05:48,354 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 17:05:48,355 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:05:36" (3/4) ... [2024-10-13 17:05:48,360 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 17:05:48,361 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 17:05:48,362 INFO L158 Benchmark]: Toolchain (without parser) took 12882.43ms. Allocated memory was 213.9MB in the beginning and 348.1MB in the end (delta: 134.2MB). Free memory was 143.1MB in the beginning and 170.7MB in the end (delta: -27.6MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. [2024-10-13 17:05:48,362 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 125.8MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:05:48,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.90ms. Allocated memory is still 213.9MB. Free memory was 143.1MB in the beginning and 131.5MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 17:05:48,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.61ms. Allocated memory is still 213.9MB. Free memory was 131.5MB in the beginning and 129.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:05:48,362 INFO L158 Benchmark]: Boogie Preprocessor took 28.15ms. Allocated memory is still 213.9MB. Free memory was 129.9MB in the beginning and 127.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:05:48,362 INFO L158 Benchmark]: RCFGBuilder took 262.95ms. Allocated memory is still 213.9MB. Free memory was 127.9MB in the beginning and 115.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 17:05:48,363 INFO L158 Benchmark]: BuchiAutomizer took 12346.99ms. Allocated memory was 213.9MB in the beginning and 348.1MB in the end (delta: 134.2MB). Free memory was 115.3MB in the beginning and 170.7MB in the end (delta: -55.4MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. [2024-10-13 17:05:48,363 INFO L158 Benchmark]: Witness Printer took 7.03ms. Allocated memory is still 348.1MB. Free memory is still 170.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:05:48,365 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.53ms. Allocated memory is still 125.8MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.90ms. Allocated memory is still 213.9MB. Free memory was 143.1MB in the beginning and 131.5MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.61ms. Allocated memory is still 213.9MB. Free memory was 131.5MB in the beginning and 129.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.15ms. Allocated memory is still 213.9MB. Free memory was 129.9MB in the beginning and 127.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 262.95ms. Allocated memory is still 213.9MB. Free memory was 127.9MB in the beginning and 115.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 12346.99ms. Allocated memory was 213.9MB in the beginning and 348.1MB in the end (delta: 134.2MB). Free memory was 115.3MB in the beginning and 170.7MB in the end (delta: -55.4MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. * Witness Printer took 7.03ms. Allocated memory is still 348.1MB. Free memory is still 170.7MB. 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 12.2s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 10.2s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. 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: 20ms 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-13 17:05:48,385 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-13 17:05:48,592 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-13 17:05:48,792 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-13 17:05:48,992 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-13 17:05:49,197 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