./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 1c36df5364345a00481880384557a6da7ee9f3df41e2ea49d72bfaffe4fac7a5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:22:17,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:22:17,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 00:22:17,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:22:17,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:22:17,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:22:17,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:22:17,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:22:17,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:22:17,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:22:17,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:22:17,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:22:17,594 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:22:17,594 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:22:17,595 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:22:17,595 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:22:17,599 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:22:17,607 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:22:17,608 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:22:17,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:22:17,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:22:17,614 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 00:22:17,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:22:17,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 00:22:17,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:22:17,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:22:17,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:22:17,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:22:17,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:22:17,617 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:22:17,617 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 00:22:17,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:22:17,618 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:22:17,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:22:17,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:22:17,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:22:17,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:22:17,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:22:17,620 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:22:17,621 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c36df5364345a00481880384557a6da7ee9f3df41e2ea49d72bfaffe4fac7a5 [2024-10-15 00:22:17,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:22:17,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:22:17,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:22:17,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:22:17,943 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:22:17,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2024-10-15 00:22:19,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:22:19,821 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:22:19,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2024-10-15 00:22:19,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba810aa7/841d13bcc9304040be0ebeba26fda7d9/FLAG34d626039 [2024-10-15 00:22:19,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba810aa7/841d13bcc9304040be0ebeba26fda7d9 [2024-10-15 00:22:19,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:22:19,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:22:19,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:22:19,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:22:19,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:22:19,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:22:19" (1/1) ... [2024-10-15 00:22:19,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60cc6e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:19, skipping insertion in model container [2024-10-15 00:22:19,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:22:19" (1/1) ... [2024-10-15 00:22:19,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:22:20,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:22:20,220 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:22:20,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:22:20,317 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:22:20,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:20 WrapperNode [2024-10-15 00:22:20,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:22:20,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:22:20,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:22:20,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:22:20,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:20" (1/1) ... [2024-10-15 00:22:20,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:20" (1/1) ... [2024-10-15 00:22:20,357 INFO L138 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-10-15 00:22:20,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:22:20,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:22:20,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:22:20,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:22:20,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:20" (1/1) ... [2024-10-15 00:22:20,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:20" (1/1) ... [2024-10-15 00:22:20,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:20" (1/1) ... [2024-10-15 00:22:20,388 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-10-15 00:22:20,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:20" (1/1) ... [2024-10-15 00:22:20,389 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:20" (1/1) ... [2024-10-15 00:22:20,393 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:20" (1/1) ... [2024-10-15 00:22:20,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:20" (1/1) ... [2024-10-15 00:22:20,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:20" (1/1) ... [2024-10-15 00:22:20,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:20" (1/1) ... [2024-10-15 00:22:20,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:22:20,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:22:20,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:22:20,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:22:20,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:20" (1/1) ... [2024-10-15 00:22:20,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:20,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:20,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:20,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-15 00:22:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 00:22:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 00:22:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 00:22:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:22:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:22:20,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:22:20,599 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:22:20,602 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:22:20,739 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-15 00:22:20,740 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:22:20,753 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:22:20,754 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-15 00:22:20,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:22:20 BoogieIcfgContainer [2024-10-15 00:22:20,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:22:20,756 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:22:20,757 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:22:20,761 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:22:20,762 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:22:20,762 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:22:19" (1/3) ... [2024-10-15 00:22:20,763 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b056e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:22:20, skipping insertion in model container [2024-10-15 00:22:20,763 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:22:20,764 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:22:20" (2/3) ... [2024-10-15 00:22:20,764 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b056e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:22:20, skipping insertion in model container [2024-10-15 00:22:20,764 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:22:20,764 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:22:20" (3/3) ... [2024-10-15 00:22:20,766 INFO L332 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-1.i [2024-10-15 00:22:20,818 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:22:20,818 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:22:20,818 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:22:20,819 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:22:20,819 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:22:20,819 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:22:20,819 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:22:20,819 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:22:20,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:20,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-15 00:22:20,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:20,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:20,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-15 00:22:20,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:22:20,848 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:22:20,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:20,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-15 00:22:20,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:20,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:20,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-15 00:22:20,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:22:20,856 INFO L745 eck$LassoCheckResult]: Stem: 15#$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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 9#L531true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 13#L531-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 12#L536-3true [2024-10-15 00:22:20,857 INFO L747 eck$LassoCheckResult]: Loop: 12#L536-3true assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3#L536-2true main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 12#L536-3true [2024-10-15 00:22:20,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:20,863 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-10-15 00:22:20,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:20,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635628503] [2024-10-15 00:22:20,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:20,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:20,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:21,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:21,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:21,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2024-10-15 00:22:21,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:21,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562113406] [2024-10-15 00:22:21,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:21,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:21,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:21,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:21,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2024-10-15 00:22:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:21,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144079804] [2024-10-15 00:22:21,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:21,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:21,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:21,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:21,482 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:22:21,483 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:22:21,483 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:22:21,483 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:22:21,483 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:22:21,484 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:21,484 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:22:21,484 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:22:21,484 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration1_Lasso [2024-10-15 00:22:21,485 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:22:21,485 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:22:21,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:21,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:21,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:21,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:21,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:21,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:21,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:21,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:21,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:22,024 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:22:22,029 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:22:22,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:22,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:22,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:22,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-15 00:22:22,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:22,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:22,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:22,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:22,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:22,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:22,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:22,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:22,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:22,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-15 00:22:22,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:22,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:22,074 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:22,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-15 00:22:22,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:22,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:22,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:22,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:22,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:22,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:22,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:22,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:22,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:22,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-15 00:22:22,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:22,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:22,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:22,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 00:22:22,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:22,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:22,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:22,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:22,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:22,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:22,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:22,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:22,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-15 00:22:22,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:22,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:22,161 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:22,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-15 00:22:22,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:22,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:22,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:22,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:22,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:22,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:22,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:22,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:22,180 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:22,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-15 00:22:22,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:22,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:22,200 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:22,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-15 00:22:22,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:22,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:22,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:22,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:22,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:22,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:22,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:22,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:22,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-15 00:22:22,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:22,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:22,241 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:22,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 00:22:22,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:22,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:22,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:22,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:22,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:22,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:22,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:22,279 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:22:22,322 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-15 00:22:22,322 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-10-15 00:22:22,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:22,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:22,345 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:22,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 00:22:22,350 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:22:22,364 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-15 00:22:22,365 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:22:22,365 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1, ULTIMATE.start_main_~i~1#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 - 4*ULTIMATE.start_main_~i~1#1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0#1.offset >= 0] [2024-10-15 00:22:22,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-15 00:22:22,403 INFO L156 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2024-10-15 00:22:22,419 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:22:22,421 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:22:22,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:22,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:22:22,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:22,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:22:22,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:22,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:22,563 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:22:22,565 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:22,639 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 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). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 30 states and 44 transitions. Complement of second has 6 states. [2024-10-15 00:22:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:22:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-10-15 00:22:22,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-15 00:22:22,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:22,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-15 00:22:22,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:22,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-15 00:22:22,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:22,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2024-10-15 00:22:22,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-15 00:22:22,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 14 states and 20 transitions. [2024-10-15 00:22:22,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:22:22,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:22:22,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2024-10-15 00:22:22,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:22:22,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-10-15 00:22:22,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2024-10-15 00:22:22,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-15 00:22:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2024-10-15 00:22:22,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-10-15 00:22:22,689 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-10-15 00:22:22,689 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:22:22,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2024-10-15 00:22:22,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-15 00:22:22,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:22,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:22,691 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:22:22,691 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:22:22,691 INFO L745 eck$LassoCheckResult]: Stem: 123#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 117#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 118#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 119#L531-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 122#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 112#L536-4 havoc main_~i~1#1;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 113#L515-3 [2024-10-15 00:22:22,692 INFO L747 eck$LassoCheckResult]: Loop: 113#L515-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 115#L519-3 assume !true; 120#L519-4 call SelectionSort_#t~mem5#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int#0(SelectionSort_#t~mem6#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int#0(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);havoc SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1; 114#L515-2 SelectionSort_#t~pre7#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre7#1; 113#L515-3 [2024-10-15 00:22:22,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:22,693 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2024-10-15 00:22:22,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:22,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552941028] [2024-10-15 00:22:22,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:22,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:22,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:22,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552941028] [2024-10-15 00:22:22,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552941028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:22:22,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:22:22,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:22:22,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351378758] [2024-10-15 00:22:22,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:22:22,841 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:22:22,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1894772, now seen corresponding path program 1 times [2024-10-15 00:22:22,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:22,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634523914] [2024-10-15 00:22:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:22,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:22,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:22,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634523914] [2024-10-15 00:22:22,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634523914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:22:22,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:22:22,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:22:22,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840606294] [2024-10-15 00:22:22,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:22:22,897 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:22:22,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:22,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:22,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 00:22:22,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 00:22:22,905 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:22,911 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-15 00:22:22,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2024-10-15 00:22:22,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-15 00:22:22,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2024-10-15 00:22:22,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-15 00:22:22,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:22:22,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2024-10-15 00:22:22,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:22:22,916 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-15 00:22:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2024-10-15 00:22:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-15 00:22:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2024-10-15 00:22:22,919 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-15 00:22:22,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 00:22:22,923 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-15 00:22:22,923 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:22:22,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2024-10-15 00:22:22,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-15 00:22:22,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:22,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:22,924 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:22:22,924 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:22:22,925 INFO L745 eck$LassoCheckResult]: Stem: 158#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 153#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 154#L531-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 157#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 147#L536-4 havoc main_~i~1#1;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 148#L515-3 [2024-10-15 00:22:22,925 INFO L747 eck$LassoCheckResult]: Loop: 148#L515-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 149#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 155#L519-4 call SelectionSort_#t~mem5#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int#0(SelectionSort_#t~mem6#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int#0(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);havoc SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1; 150#L515-2 SelectionSort_#t~pre7#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre7#1; 148#L515-3 [2024-10-15 00:22:22,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:22,925 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2024-10-15 00:22:22,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:22,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535777620] [2024-10-15 00:22:22,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:23,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:23,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535777620] [2024-10-15 00:22:23,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535777620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:22:23,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:22:23,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:22:23,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808394338] [2024-10-15 00:22:23,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:22:23,009 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:22:23,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:23,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1884201, now seen corresponding path program 1 times [2024-10-15 00:22:23,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:23,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896634649] [2024-10-15 00:22:23,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:23,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:23,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:23,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896634649] [2024-10-15 00:22:23,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896634649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:22:23,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:22:23,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:22:23,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643776961] [2024-10-15 00:22:23,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:22:23,066 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:22:23,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:22:23,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:22:23,067 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:23,085 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-15 00:22:23,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2024-10-15 00:22:23,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-15 00:22:23,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2024-10-15 00:22:23,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-15 00:22:23,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-15 00:22:23,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2024-10-15 00:22:23,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:22:23,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-15 00:22:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2024-10-15 00:22:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-15 00:22:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-10-15 00:22:23,091 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-15 00:22:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:22:23,094 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-15 00:22:23,094 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:22:23,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2024-10-15 00:22:23,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-15 00:22:23,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:23,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:23,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:22:23,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:23,097 INFO L745 eck$LassoCheckResult]: Stem: 195#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 191#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 192#L531-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 194#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 184#L536-4 havoc main_~i~1#1;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 185#L515-3 [2024-10-15 00:22:23,098 INFO L747 eck$LassoCheckResult]: Loop: 185#L515-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 186#L519-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 193#L521 assume SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 188#L519-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 189#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 196#L519-4 call SelectionSort_#t~mem5#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int#0(SelectionSort_#t~mem6#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int#0(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);havoc SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1; 187#L515-2 SelectionSort_#t~pre7#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre7#1; 185#L515-3 [2024-10-15 00:22:23,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 3 times [2024-10-15 00:22:23,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:23,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787512343] [2024-10-15 00:22:23,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:23,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:23,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787512343] [2024-10-15 00:22:23,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787512343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:22:23,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:22:23,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:22:23,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790619958] [2024-10-15 00:22:23,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:22:23,155 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:22:23,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:23,156 INFO L85 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 1 times [2024-10-15 00:22:23,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:23,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642140577] [2024-10-15 00:22:23,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:23,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:23,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:23,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:23,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:23,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:22:23,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:22:23,349 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:23,371 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2024-10-15 00:22:23,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2024-10-15 00:22:23,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-15 00:22:23,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2024-10-15 00:22:23,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-15 00:22:23,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-15 00:22:23,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2024-10-15 00:22:23,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:22:23,375 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-15 00:22:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2024-10-15 00:22:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-10-15 00:22:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-10-15 00:22:23,379 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-15 00:22:23,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:22:23,380 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-15 00:22:23,384 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:22:23,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2024-10-15 00:22:23,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-15 00:22:23,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:23,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:23,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:23,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:23,385 INFO L745 eck$LassoCheckResult]: Stem: 233#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 228#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 229#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 230#L531-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 232#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 220#L536-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 221#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 222#L536-4 havoc main_~i~1#1;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 223#L515-3 [2024-10-15 00:22:23,386 INFO L747 eck$LassoCheckResult]: Loop: 223#L515-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 224#L519-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 231#L521 assume SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 226#L519-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 227#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 234#L519-4 call SelectionSort_#t~mem5#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int#0(SelectionSort_#t~mem6#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int#0(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);havoc SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1; 225#L515-2 SelectionSort_#t~pre7#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre7#1; 223#L515-3 [2024-10-15 00:22:23,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:23,386 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2024-10-15 00:22:23,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:23,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447765838] [2024-10-15 00:22:23,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:23,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:23,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:23,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:23,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 2 times [2024-10-15 00:22:23,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:23,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135075019] [2024-10-15 00:22:23,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:23,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:23,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:23,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:23,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:23,464 INFO L85 PathProgramCache]: Analyzing trace with hash 651542188, now seen corresponding path program 1 times [2024-10-15 00:22:23,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:23,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123378929] [2024-10-15 00:22:23,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:23,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:22:23,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:23,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123378929] [2024-10-15 00:22:23,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123378929] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:22:23,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840629349] [2024-10-15 00:22:23,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:23,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:22:23,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:23,668 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:22:23,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-15 00:22:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:23,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:22:23,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:22:23,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:22:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:22:23,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840629349] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:22:23,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:22:23,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-15 00:22:23,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907788407] [2024-10-15 00:22:23,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:22:24,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:24,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 00:22:24,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-15 00:22:24,041 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:24,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:24,125 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-10-15 00:22:24,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2024-10-15 00:22:24,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-15 00:22:24,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 21 transitions. [2024-10-15 00:22:24,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-15 00:22:24,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-15 00:22:24,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2024-10-15 00:22:24,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:22:24,127 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-15 00:22:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2024-10-15 00:22:24,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-10-15 00:22:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-10-15 00:22:24,129 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-15 00:22:24,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 00:22:24,130 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-15 00:22:24,130 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:22:24,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2024-10-15 00:22:24,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-15 00:22:24,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:24,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:24,131 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:24,131 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:24,132 INFO L745 eck$LassoCheckResult]: Stem: 378#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 372#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 373#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 374#L531-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 376#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 364#L536-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 365#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 377#L536-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 380#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 366#L536-4 havoc main_~i~1#1;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 367#L515-3 [2024-10-15 00:22:24,132 INFO L747 eck$LassoCheckResult]: Loop: 367#L515-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 368#L519-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 375#L521 assume SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 370#L519-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 371#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 379#L519-4 call SelectionSort_#t~mem5#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int#0(SelectionSort_#t~mem6#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int#0(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);havoc SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1; 369#L515-2 SelectionSort_#t~pre7#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre7#1; 367#L515-3 [2024-10-15 00:22:24,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:24,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2024-10-15 00:22:24,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:24,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584758773] [2024-10-15 00:22:24,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:24,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:24,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:24,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:24,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:24,157 INFO L85 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 3 times [2024-10-15 00:22:24,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:24,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583780001] [2024-10-15 00:22:24,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:24,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:24,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:24,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:24,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash 219717770, now seen corresponding path program 2 times [2024-10-15 00:22:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:24,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615270655] [2024-10-15 00:22:24,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:24,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:24,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:24,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:24,617 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:22:24,617 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:22:24,617 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:22:24,618 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:22:24,618 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:22:24,618 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:24,618 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:22:24,618 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:22:24,618 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration6_Lasso [2024-10-15 00:22:24,618 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:22:24,618 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:22:24,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:24,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:25,110 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:22:25,110 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:22:25,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:25,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:25,115 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:25,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-15 00:22:25,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:25,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:25,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:25,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:25,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:25,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:25,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:25,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:25,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:25,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:25,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:25,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:25,144 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:25,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-15 00:22:25,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:25,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:25,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:25,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:25,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:25,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:25,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:25,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:25,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:25,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:25,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:25,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:25,175 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:25,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-15 00:22:25,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:25,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:25,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:25,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:25,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:25,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:25,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:25,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:25,193 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:25,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-15 00:22:25,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:25,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:25,212 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:25,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-15 00:22:25,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:25,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:25,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:25,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:25,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:25,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:25,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:25,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:25,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:25,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:25,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:25,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:25,251 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:25,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-15 00:22:25,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:25,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:25,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:25,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:25,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:25,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:25,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:25,272 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:25,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-15 00:22:25,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:25,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:25,292 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:25,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-15 00:22:25,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:25,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:25,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:25,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:25,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:25,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:25,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:25,323 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:22:25,367 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2024-10-15 00:22:25,368 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-15 00:22:25,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:25,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:25,370 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:25,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-15 00:22:25,375 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:22:25,391 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-15 00:22:25,391 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:22:25,392 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_2, ULTIMATE.start_SelectionSort_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_2 - 4*ULTIMATE.start_SelectionSort_~i~0#1 Supporting invariants [1*ULTIMATE.start_SelectionSort_~a#1.offset >= 0] [2024-10-15 00:22:25,408 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-15 00:22:25,422 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2024-10-15 00:22:25,426 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:22:25,426 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:22:25,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:25,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 00:22:25,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:25,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:22:25,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:25,654 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-15 00:22:25,655 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:25,774 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 24 states and 30 transitions. Complement of second has 9 states. [2024-10-15 00:22:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-15 00:22:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2024-10-15 00:22:25,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 10 letters. Loop has 7 letters. [2024-10-15 00:22:25,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:25,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 17 letters. Loop has 7 letters. [2024-10-15 00:22:25,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:25,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 10 letters. Loop has 14 letters. [2024-10-15 00:22:25,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:25,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2024-10-15 00:22:25,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:22:25,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 28 transitions. [2024-10-15 00:22:25,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:22:25,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:22:25,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2024-10-15 00:22:25,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:25,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-15 00:22:25,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2024-10-15 00:22:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-10-15 00:22:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-10-15 00:22:25,785 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-15 00:22:25,785 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-15 00:22:25,785 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:22:25,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2024-10-15 00:22:25,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:22:25,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:25,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:25,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:25,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:22:25,787 INFO L745 eck$LassoCheckResult]: Stem: 533#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 526#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 527#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 528#L531-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 531#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 515#L536-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 516#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 532#L536-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 535#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 517#L536-4 havoc main_~i~1#1;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 518#L515-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 522#L519-3 [2024-10-15 00:22:25,788 INFO L747 eck$LassoCheckResult]: Loop: 522#L519-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 529#L521 assume SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 523#L519-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 522#L519-3 [2024-10-15 00:22:25,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:25,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2024-10-15 00:22:25,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:25,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034077984] [2024-10-15 00:22:25,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:25,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:25,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:25,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:25,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:25,823 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2024-10-15 00:22:25,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:25,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258539535] [2024-10-15 00:22:25,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:25,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:25,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:25,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:25,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2024-10-15 00:22:25,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:25,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872095210] [2024-10-15 00:22:25,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:25,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:25,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:25,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:26,240 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:22:26,241 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:22:26,241 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:22:26,241 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:22:26,241 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:22:26,241 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,241 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:22:26,241 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:22:26,241 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration7_Lasso [2024-10-15 00:22:26,241 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:22:26,242 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:22:26,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:26,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:26,772 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:22:26,773 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:22:26,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,775 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-15 00:22:26,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,805 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-15 00:22:26,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,806 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-15 00:22:26,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:26,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,833 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-15 00:22:26,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-15 00:22:26,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:26,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,861 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-15 00:22:26,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-15 00:22:26,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,892 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-15 00:22:26,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:26,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,918 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-15 00:22:26,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,943 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-15 00:22:26,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,944 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-15 00:22:26,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:26,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:26,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:26,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-15 00:22:26,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,970 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:26,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-15 00:22:26,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:26,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:26,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:26,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:26,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:26,984 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:26,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:26,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:26,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-15 00:22:26,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:26,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:26,999 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-15 00:22:27,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:27,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:27,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:27,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:27,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:27,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:27,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:27,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:27,014 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:27,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-15 00:22:27,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:27,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,028 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-15 00:22:27,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:27,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:27,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:27,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:27,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:27,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:27,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:27,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:27,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:27,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:27,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:27,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,055 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-15 00:22:27,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:27,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:27,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:27,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:27,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:27,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:27,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:27,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:27,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:27,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-15 00:22:27,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:27,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,083 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-15 00:22:27,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:27,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:27,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:27,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:27,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:27,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:27,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:27,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:27,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-15 00:22:27,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:27,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,111 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-15 00:22:27,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:27,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:27,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:27,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:27,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:27,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:27,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:27,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:27,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:27,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-15 00:22:27,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:27,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,137 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-15 00:22:27,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-15 00:22:27,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:27,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:27,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:27,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:27,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:27,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:27,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:27,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-15 00:22:27,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:27,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,171 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-15 00:22:27,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:27,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:27,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:27,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:27,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:27,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:27,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:27,207 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:22:27,229 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-15 00:22:27,229 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-15 00:22:27,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:27,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,231 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-15 00:22:27,233 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:22:27,248 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:22:27,248 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:22:27,248 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size#1, ULTIMATE.start_SelectionSort_~j~0#1) = 1*ULTIMATE.start_SelectionSort_~array_size#1 - 1*ULTIMATE.start_SelectionSort_~j~0#1 Supporting invariants [] [2024-10-15 00:22:27,264 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-15 00:22:27,278 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-10-15 00:22:27,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:27,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:22:27,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:27,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:22:27,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:27,349 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:22:27,349 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:27,371 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 33 states and 46 transitions. Complement of second has 5 states. [2024-10-15 00:22:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:22:27,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:22:27,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 3 letters. [2024-10-15 00:22:27,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:27,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 14 letters. Loop has 3 letters. [2024-10-15 00:22:27,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:27,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 6 letters. [2024-10-15 00:22:27,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:27,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2024-10-15 00:22:27,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:22:27,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 25 states and 32 transitions. [2024-10-15 00:22:27,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:22:27,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:22:27,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2024-10-15 00:22:27,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:27,378 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-15 00:22:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2024-10-15 00:22:27,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2024-10-15 00:22:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-10-15 00:22:27,380 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-15 00:22:27,380 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-15 00:22:27,380 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:22:27,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2024-10-15 00:22:27,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:22:27,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:27,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:27,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:27,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:22:27,382 INFO L745 eck$LassoCheckResult]: Stem: 669#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 662#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 663#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 664#L531-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 667#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 651#L536-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 652#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 668#L536-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 671#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 653#L536-4 havoc main_~i~1#1;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 654#L515-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 657#L519-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 666#L521 assume !(SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1);havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1; 660#L519-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 661#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 670#L519-4 call SelectionSort_#t~mem5#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int#0(SelectionSort_#t~mem6#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int#0(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);havoc SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1; 655#L515-2 SelectionSort_#t~pre7#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre7#1; 656#L515-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 658#L519-3 [2024-10-15 00:22:27,382 INFO L747 eck$LassoCheckResult]: Loop: 658#L519-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 665#L521 assume SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 659#L519-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 658#L519-3 [2024-10-15 00:22:27,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1721425389, now seen corresponding path program 1 times [2024-10-15 00:22:27,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:27,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475999213] [2024-10-15 00:22:27,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:22:27,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:27,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475999213] [2024-10-15 00:22:27,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475999213] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:22:27,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013098909] [2024-10-15 00:22:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:27,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:22:27,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:27,505 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:22:27,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-10-15 00:22:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:27,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:22:27,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:22:27,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:22:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:22:27,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013098909] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:22:27,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:22:27,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-15 00:22:27,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060722497] [2024-10-15 00:22:27,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:22:27,699 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:22:27,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:27,699 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2024-10-15 00:22:27,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:27,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627605173] [2024-10-15 00:22:27,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:27,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:27,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:27,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:27,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:27,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-15 00:22:27,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-15 00:22:27,780 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:27,835 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-10-15 00:22:27,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2024-10-15 00:22:27,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:22:27,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 29 transitions. [2024-10-15 00:22:27,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:22:27,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:22:27,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2024-10-15 00:22:27,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:27,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-10-15 00:22:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2024-10-15 00:22:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-10-15 00:22:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-10-15 00:22:27,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-15 00:22:27,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 00:22:27,840 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-15 00:22:27,841 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:22:27,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-10-15 00:22:27,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:22:27,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:27,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:27,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:27,842 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:22:27,842 INFO L745 eck$LassoCheckResult]: Stem: 841#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 833#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 834#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 835#L531-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 838#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 822#L536-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 823#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 844#L536-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 839#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 840#L536-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 843#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 824#L536-4 havoc main_~i~1#1;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 825#L515-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 826#L519-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 837#L521 assume !(SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1);havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1; 831#L519-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 832#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 842#L519-4 call SelectionSort_#t~mem5#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int#0(SelectionSort_#t~mem6#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int#0(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);havoc SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1; 829#L515-2 SelectionSort_#t~pre7#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre7#1; 827#L515-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 828#L519-3 [2024-10-15 00:22:27,842 INFO L747 eck$LassoCheckResult]: Loop: 828#L519-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 836#L521 assume SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 830#L519-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 828#L519-3 [2024-10-15 00:22:27,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:27,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1519356789, now seen corresponding path program 2 times [2024-10-15 00:22:27,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:27,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032284843] [2024-10-15 00:22:27,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:27,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:27,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-15 00:22:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:28,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:28,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032284843] [2024-10-15 00:22:28,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032284843] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:22:28,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782387248] [2024-10-15 00:22:28,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:22:28,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:22:28,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:28,027 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:22:28,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-10-15 00:22:28,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:22:28,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:22:28,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:22:28,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:28,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:22:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:28,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782387248] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:22:28,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:22:28,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-15 00:22:28,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121971253] [2024-10-15 00:22:28,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:22:28,281 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:22:28,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:28,281 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2024-10-15 00:22:28,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:28,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138575720] [2024-10-15 00:22:28,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:28,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:28,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:28,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:28,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-15 00:22:28,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-10-15 00:22:28,363 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:28,520 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2024-10-15 00:22:28,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2024-10-15 00:22:28,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:22:28,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 44 transitions. [2024-10-15 00:22:28,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:22:28,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:22:28,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2024-10-15 00:22:28,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:28,522 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-10-15 00:22:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2024-10-15 00:22:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2024-10-15 00:22:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-10-15 00:22:28,524 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-10-15 00:22:28,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 00:22:28,525 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-10-15 00:22:28,525 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:22:28,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2024-10-15 00:22:28,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:22:28,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:28,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:28,527 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:28,527 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:22:28,527 INFO L745 eck$LassoCheckResult]: Stem: 1040#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1032#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1033#L531 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1034#L531-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1038#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1021#L536-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1022#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1039#L536-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1044#L536-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1043#L536-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1042#L536-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1023#L536-4 havoc main_~i~1#1;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~mem6#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_#t~pre7#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; 1024#L515-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 1025#L519-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 1046#L521 assume !(SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1);havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1; 1031#L519-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 1027#L519-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 1036#L521 assume !(SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1);havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1; 1037#L519-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 1045#L519-3 assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); 1041#L519-4 call SelectionSort_#t~mem5#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem5#1;havoc SelectionSort_#t~mem5#1;call SelectionSort_#t~mem6#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);call write~int#0(SelectionSort_#t~mem6#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~i~0#1, 4);havoc SelectionSort_#t~mem6#1;call write~int#0(SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4);havoc SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1; 1029#L515-2 SelectionSort_#t~pre7#1 := 1 + SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~i~0#1;havoc SelectionSort_#t~pre7#1; 1026#L515-3 assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; 1028#L519-3 [2024-10-15 00:22:28,527 INFO L747 eck$LassoCheckResult]: Loop: 1028#L519-3 assume !!(SelectionSort_~j~0#1 < SelectionSort_~array_size#1);call SelectionSort_#t~mem2#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~j~0#1, 4);call SelectionSort_#t~mem3#1 := read~int#0(SelectionSort_~a#1.base, SelectionSort_~a#1.offset + 4 * SelectionSort_~min~0#1, 4); 1035#L521 assume SelectionSort_#t~mem2#1 < SelectionSort_#t~mem3#1;havoc SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem3#1;SelectionSort_~min~0#1 := SelectionSort_~j~0#1; 1030#L519-2 SelectionSort_#t~pre4#1 := 1 + SelectionSort_~j~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~j~0#1;havoc SelectionSort_#t~pre4#1; 1028#L519-3 [2024-10-15 00:22:28,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:28,529 INFO L85 PathProgramCache]: Analyzing trace with hash 95688324, now seen corresponding path program 3 times [2024-10-15 00:22:28,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:28,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457018650] [2024-10-15 00:22:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:28,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:28,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:28,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:28,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:28,570 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2024-10-15 00:22:28,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:28,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647257356] [2024-10-15 00:22:28,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:28,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:28,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:28,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:28,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1207385433, now seen corresponding path program 1 times [2024-10-15 00:22:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:28,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337154499] [2024-10-15 00:22:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:28,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:28,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:28,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:30,506 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:22:30,507 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:22:30,507 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:22:30,507 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:22:30,507 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:22:30,507 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:30,507 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:22:30,507 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:22:30,507 INFO L132 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration10_Lasso [2024-10-15 00:22:30,507 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:22:30,508 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:22:30,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:30,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:31,130 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:22:31,131 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:22:31,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:31,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:31,133 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:31,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-15 00:22:31,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:31,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:31,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:31,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:31,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:31,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:31,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:31,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:31,148 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:31,159 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-15 00:22:31,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:31,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:31,162 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:31,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-15 00:22:31,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-15 00:22:31,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:31,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:31,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:31,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:31,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:31,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:31,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:31,180 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:31,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:31,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:31,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:31,192 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:31,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-15 00:22:31,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:31,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:31,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:31,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:31,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:31,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:31,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:31,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:31,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:31,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-15 00:22:31,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:31,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:31,219 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:31,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-15 00:22:31,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:31,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:31,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:31,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:31,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:31,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:31,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:31,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:31,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:31,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:31,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:31,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:31,247 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:31,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-15 00:22:31,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:31,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:31,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:31,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:31,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:31,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:31,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:31,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:31,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:31,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-10-15 00:22:31,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:31,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:31,275 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:31,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-15 00:22:31,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:31,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:31,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:31,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:31,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:31,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:31,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:31,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:31,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-10-15 00:22:31,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:31,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:31,310 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:31,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-15 00:22:31,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:31,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:31,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:31,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:31,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:31,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:31,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:31,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:31,355 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-15 00:22:31,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:31,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:31,357 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:31,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-15 00:22:31,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:31,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:31,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:31,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:31,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:31,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:31,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:31,400 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:22:31,428 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-15 00:22:31,429 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-15 00:22:31,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:31,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:31,431 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:31,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-15 00:22:31,435 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:22:31,450 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:22:31,450 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:22:31,450 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size#1, ULTIMATE.start_SelectionSort_~j~0#1) = 1*ULTIMATE.start_SelectionSort_~array_size#1 - 1*ULTIMATE.start_SelectionSort_~j~0#1 Supporting invariants [] [2024-10-15 00:22:31,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-10-15 00:22:31,479 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-10-15 00:22:31,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:31,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:22:31,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:31,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:22:31,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:31,569 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:22:31,570 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:31,588 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 34 states and 45 transitions. Complement of second has 5 states. [2024-10-15 00:22:31,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:22:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:22:31,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 23 letters. Loop has 3 letters. [2024-10-15 00:22:31,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:31,589 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:22:31,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:31,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:22:31,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:31,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:22:31,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:31,678 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:22:31,678 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:31,694 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 34 states and 45 transitions. Complement of second has 5 states. [2024-10-15 00:22:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:22:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:22:31,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 23 letters. Loop has 3 letters. [2024-10-15 00:22:31,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:31,696 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:22:31,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:31,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:22:31,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:31,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:22:31,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:31,784 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:22:31,784 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:31,802 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 33 states and 44 transitions. Complement of second has 4 states. [2024-10-15 00:22:31,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:22:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2024-10-15 00:22:31,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 23 letters. Loop has 3 letters. [2024-10-15 00:22:31,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:31,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 26 letters. Loop has 3 letters. [2024-10-15 00:22:31,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:31,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 23 letters. Loop has 6 letters. [2024-10-15 00:22:31,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:31,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 44 transitions. [2024-10-15 00:22:31,805 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:22:31,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2024-10-15 00:22:31,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:22:31,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:22:31,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:22:31,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:22:31,805 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:22:31,805 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:22:31,805 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:22:31,805 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 00:22:31,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 00:22:31,806 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:22:31,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 00:22:31,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:22:31 BoogieIcfgContainer [2024-10-15 00:22:31,819 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:22:31,820 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:22:31,820 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:22:31,820 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:22:31,821 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:22:20" (3/4) ... [2024-10-15 00:22:31,825 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 00:22:31,826 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:22:31,827 INFO L158 Benchmark]: Toolchain (without parser) took 11968.31ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 105.5MB in the beginning and 69.7MB in the end (delta: 35.8MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. [2024-10-15 00:22:31,827 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 153.1MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:22:31,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.67ms. Allocated memory is still 153.1MB. Free memory was 105.5MB in the beginning and 87.0MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-15 00:22:31,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.74ms. Allocated memory is still 153.1MB. Free memory was 87.0MB in the beginning and 85.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:22:31,828 INFO L158 Benchmark]: Boogie Preprocessor took 42.47ms. Allocated memory is still 153.1MB. Free memory was 85.1MB in the beginning and 83.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:22:31,828 INFO L158 Benchmark]: RCFGBuilder took 352.69ms. Allocated memory is still 153.1MB. Free memory was 83.0MB in the beginning and 70.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 00:22:31,828 INFO L158 Benchmark]: BuchiAutomizer took 11063.77ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 70.4MB in the beginning and 70.7MB in the end (delta: -297.0kB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2024-10-15 00:22:31,828 INFO L158 Benchmark]: Witness Printer took 6.45ms. Allocated memory is still 203.4MB. Free memory was 70.7MB in the beginning and 69.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:22:31,830 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 153.1MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.67ms. Allocated memory is still 153.1MB. Free memory was 105.5MB in the beginning and 87.0MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.74ms. Allocated memory is still 153.1MB. Free memory was 87.0MB in the beginning and 85.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.47ms. Allocated memory is still 153.1MB. Free memory was 85.1MB in the beginning and 83.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 352.69ms. Allocated memory is still 153.1MB. Free memory was 83.0MB in the beginning and 70.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 11063.77ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 70.4MB in the beginning and 70.7MB in the end (delta: -297.0kB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * Witness Printer took 6.45ms. Allocated memory is still 203.4MB. Free memory was 70.7MB in the beginning and 69.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 10 terminating modules (6 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function (array_size + ((long long) -1 * j)) and consists of 3 locations. One nondeterministic module has affine ranking function (array_size + ((long long) -1 * j)) and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.0s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 9.4s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 17 StatesRemovedByMinimization, 6 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 [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 148 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 350 IncrementalHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 126 mSDtfsCounter, 350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI2 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital208 mio100 ax110 hnf100 lsp89 ukn64 mio100 lsp58 div144 bol100 ite100 ukn100 eq152 hnf93 smp82 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-15 00:22:31,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-15 00:22:32,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-10-15 00:22:32,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-10-15 00:22:32,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:32,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE