./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/java_BubbleSort-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 ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:01:55,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:01:55,814 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:01:55,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:01:55,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:01:55,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:01:55,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:01:55,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:01:55,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:01:55,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:01:55,842 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:01:55,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:01:55,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:01:55,843 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:01:55,843 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:01:55,843 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:01:55,843 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:01:55,843 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:01:55,843 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:01:55,843 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:01:55,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:01:55,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:01:55,843 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:01:55,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:01:55,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:01:55,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:01:55,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:01:55,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:01:55,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:01:55,845 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:01:55,846 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:01:55,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:01:55,846 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:01:55,846 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:01:55,846 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:01:55,846 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:01:55,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:01:55,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:01:55,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:01:55,846 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:01:55,847 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 [2025-03-17 20:01:56,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:01:56,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:01:56,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:01:56,097 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:01:56,098 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:01:56,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2025-03-17 20:01:57,220 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530c339eb/f81f8d8f976541b8b468b4179061e580/FLAG13882a5fb [2025-03-17 20:01:57,491 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:01:57,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2025-03-17 20:01:57,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530c339eb/f81f8d8f976541b8b468b4179061e580/FLAG13882a5fb [2025-03-17 20:01:57,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530c339eb/f81f8d8f976541b8b468b4179061e580 [2025-03-17 20:01:57,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:01:57,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:01:57,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:01:57,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:01:57,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:01:57,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:01:57" (1/1) ... [2025-03-17 20:01:57,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2922be01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:57, skipping insertion in model container [2025-03-17 20:01:57,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:01:57" (1/1) ... [2025-03-17 20:01:57,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:01:58,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:01:58,012 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:01:58,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:01:58,070 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:01:58,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:58 WrapperNode [2025-03-17 20:01:58,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:01:58,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:01:58,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:01:58,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:01:58,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:58" (1/1) ... [2025-03-17 20:01:58,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:58" (1/1) ... [2025-03-17 20:01:58,093 INFO L138 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2025-03-17 20:01:58,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:01:58,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:01:58,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:01:58,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:01:58,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:58" (1/1) ... [2025-03-17 20:01:58,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:58" (1/1) ... [2025-03-17 20:01:58,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:58" (1/1) ... [2025-03-17 20:01:58,111 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]. [2025-03-17 20:01:58,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:58" (1/1) ... [2025-03-17 20:01:58,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:58" (1/1) ... [2025-03-17 20:01:58,115 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:58" (1/1) ... [2025-03-17 20:01:58,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:58" (1/1) ... [2025-03-17 20:01:58,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:58" (1/1) ... [2025-03-17 20:01:58,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:58" (1/1) ... [2025-03-17 20:01:58,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:01:58,118 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:01:58,118 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:01:58,118 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:01:58,119 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:58" (1/1) ... [2025-03-17 20:01:58,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:58,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:58,141 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) [2025-03-17 20:01:58,143 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 [2025-03-17 20:01:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 20:01:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 20:01:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 20:01:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 20:01:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:01:58,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:01:58,215 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:01:58,216 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:01:58,295 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L526: call ULTIMATE.dealloc(main_#t~malloc9#1.base, main_#t~malloc9#1.offset);havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset; [2025-03-17 20:01:58,299 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 20:01:58,300 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:01:58,305 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:01:58,305 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:01:58,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:01:58 BoogieIcfgContainer [2025-03-17 20:01:58,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:01:58,306 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:01:58,306 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:01:58,310 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:01:58,310 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:01:58,310 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:01:57" (1/3) ... [2025-03-17 20:01:58,311 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@316be00e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:01:58, skipping insertion in model container [2025-03-17 20:01:58,311 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:01:58,311 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:58" (2/3) ... [2025-03-17 20:01:58,311 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@316be00e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:01:58, skipping insertion in model container [2025-03-17 20:01:58,311 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:01:58,311 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:01:58" (3/3) ... [2025-03-17 20:01:58,312 INFO L363 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2025-03-17 20:01:58,350 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:01:58,351 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:01:58,351 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:01:58,351 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:01:58,352 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:01:58,352 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:01:58,352 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:01:58,352 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:01:58,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) [2025-03-17 20:01:58,368 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-17 20:01:58,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:58,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:58,371 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:01:58,371 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:01:58,371 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:01:58,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) [2025-03-17 20:01:58,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-17 20:01:58,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:58,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:58,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:01:58,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:01:58,375 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" [2025-03-17 20:01:58,376 INFO L754 eck$LassoCheckResult]: Loop: "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-03-17 20:01:58,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:58,379 INFO L85 PathProgramCache]: Analyzing trace with hash 44652, now seen corresponding path program 1 times [2025-03-17 20:01:58,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:58,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642562825] [2025-03-17 20:01:58,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:58,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:01:58,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:01:58,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:58,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:58,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:58,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:01:58,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:01:58,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:58,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:58,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:58,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:58,473 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 1 times [2025-03-17 20:01:58,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:58,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185150624] [2025-03-17 20:01:58,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:58,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:58,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:01:58,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:01:58,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:58,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:58,481 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:58,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:01:58,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:01:58,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:58,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:58,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:58,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:58,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1384223, now seen corresponding path program 1 times [2025-03-17 20:01:58,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:58,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328208128] [2025-03-17 20:01:58,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:58,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:58,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:01:58,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:01:58,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:58,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:58,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:58,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:01:58,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:01:58,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:58,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:58,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:58,744 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:58,745 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:58,745 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:58,745 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:58,745 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:58,745 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:58,745 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:58,745 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:58,746 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2025-03-17 20:01:58,746 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:58,746 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:58,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:58,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:58,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:58,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:58,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:58,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:58,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:58,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:58,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:59,114 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:59,117 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:59,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:59,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:59,120 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) [2025-03-17 20:01:59,122 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 [2025-03-17 20:01:59,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:01:59,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:59,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:59,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:59,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:59,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:59,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:59,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:59,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:59,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:59,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:59,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:59,151 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) [2025-03-17 20:01:59,153 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 [2025-03-17 20:01:59,154 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 [2025-03-17 20:01:59,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:59,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:59,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:59,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:59,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:59,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:59,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:59,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:59,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:59,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:59,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:59,174 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) [2025-03-17 20:01:59,175 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 [2025-03-17 20:01:59,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 [2025-03-17 20:01:59,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:59,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:59,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:59,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:59,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:59,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:59,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:59,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:59,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:59,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:59,200 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) [2025-03-17 20:01:59,201 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 [2025-03-17 20:01:59,203 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 [2025-03-17 20:01:59,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:59,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:59,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:59,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:59,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:59,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:59,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:59,224 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 [2025-03-17 20:01:59,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:59,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:59,226 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) [2025-03-17 20:01:59,228 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 [2025-03-17 20:01:59,229 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 [2025-03-17 20:01:59,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:59,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:59,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:59,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:59,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:59,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:59,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:59,241 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:59,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:59,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:59,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:59,249 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) [2025-03-17 20:01:59,251 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 [2025-03-17 20:01:59,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 [2025-03-17 20:01:59,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:59,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:59,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:59,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:59,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:59,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:59,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:59,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:59,269 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 [2025-03-17 20:01:59,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:59,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:59,271 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) [2025-03-17 20:01:59,272 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 [2025-03-17 20:01:59,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:01:59,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:59,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:59,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:59,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:59,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:59,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:59,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:59,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 20:01:59,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:59,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:59,296 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:01:59,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 20:01:59,299 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 [2025-03-17 20:01:59,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:59,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:59,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:59,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:59,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:59,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:59,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:59,311 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:59,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:59,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:59,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:59,319 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) [2025-03-17 20:01:59,319 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 [2025-03-17 20:01:59,322 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 [2025-03-17 20:01:59,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:59,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:59,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:59,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:59,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:59,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:59,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:59,343 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 [2025-03-17 20:01:59,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:59,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:59,345 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) [2025-03-17 20:01:59,346 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 [2025-03-17 20:01:59,347 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 [2025-03-17 20:01:59,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:59,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:59,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:59,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:59,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:59,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:59,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:59,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:59,365 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 [2025-03-17 20:01:59,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:59,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:59,367 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) [2025-03-17 20:01:59,369 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 [2025-03-17 20:01:59,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:01:59,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:59,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:59,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:59,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:59,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:59,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:59,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:59,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:59,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:59,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:59,397 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) [2025-03-17 20:01:59,398 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 [2025-03-17 20:01:59,399 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 [2025-03-17 20:01:59,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:59,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:59,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:59,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:59,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:59,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:59,424 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:59,447 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-03-17 20:01:59,449 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-17 20:01:59,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:59,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:59,453 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) [2025-03-17 20:01:59,454 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 [2025-03-17 20:01:59,454 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:59,466 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-17 20:01:59,466 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:59,466 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] [2025-03-17 20:01:59,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 20:01:59,483 INFO L156 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2025-03-17 20:01:59,505 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:01:59,505 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:01:59,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:59,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:01:59,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:01:59,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:59,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:59,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:01:59,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:59,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:01:59,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:01:59,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:59,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:59,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:01:59,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:59,575 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:01:59,576 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) 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) [2025-03-17 20:01:59,607 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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). 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) Result 13 states and 19 transitions. Complement of second has 3 states. [2025-03-17 20:01:59,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:01:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2025-03-17 20:01:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5 transitions. [2025-03-17 20:01:59,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-17 20:01:59,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:59,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-17 20:01:59,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:59,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-17 20:01:59,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:59,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 19 transitions. [2025-03-17 20:01:59,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:01:59,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 10 states and 15 transitions. [2025-03-17 20:01:59,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 20:01:59,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:01:59,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2025-03-17 20:01:59,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:01:59,621 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-17 20:01:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2025-03-17 20:01:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-17 20:01:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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) [2025-03-17 20:01:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2025-03-17 20:01:59,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-03-17 20:01:59,639 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-03-17 20:01:59,639 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:01:59,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2025-03-17 20:01:59,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:01:59,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:59,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:59,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:01:59,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:59,640 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" [2025-03-17 20:01:59,640 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-03-17 20:01:59,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:59,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1384222, now seen corresponding path program 1 times [2025-03-17 20:01:59,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:59,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906058242] [2025-03-17 20:01:59,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:59,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:59,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:01:59,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:01:59,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:59,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:59,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:59,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906058242] [2025-03-17 20:01:59,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906058242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:01:59,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:01:59,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:01:59,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836988155] [2025-03-17 20:01:59,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:01:59,713 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:01:59,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:59,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1244, now seen corresponding path program 1 times [2025-03-17 20:01:59,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:59,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331581281] [2025-03-17 20:01:59,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:59,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:59,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:59,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:59,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:59,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:59,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331581281] [2025-03-17 20:01:59,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331581281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:01:59,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:01:59,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 20:01:59,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745656679] [2025-03-17 20:01:59,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:01:59,726 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:01:59,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:01:59,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:01:59,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:01:59,728 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. cyclomatic complexity: 7 Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2025-03-17 20:01:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:01:59,737 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2025-03-17 20:01:59,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 15 transitions. [2025-03-17 20:01:59,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 20:01:59,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 15 transitions. [2025-03-17 20:01:59,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 20:01:59,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:01:59,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2025-03-17 20:01:59,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:01:59,738 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-17 20:01:59,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2025-03-17 20:01:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-17 20:01:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 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) [2025-03-17 20:01:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2025-03-17 20:01:59,739 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-17 20:01:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:01:59,740 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-17 20:01:59,740 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:01:59,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2025-03-17 20:01:59,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 20:01:59,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:59,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:59,740 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:01:59,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:01:59,740 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" [2025-03-17 20:01:59,740 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-03-17 20:01:59,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:59,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1384222, now seen corresponding path program 2 times [2025-03-17 20:01:59,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:59,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387514879] [2025-03-17 20:01:59,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:59,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:59,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:01:59,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:01:59,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:01:59,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:59,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:59,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387514879] [2025-03-17 20:01:59,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387514879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:01:59,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:01:59,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:01:59,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548174697] [2025-03-17 20:01:59,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:01:59,779 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:01:59,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:59,780 INFO L85 PathProgramCache]: Analyzing trace with hash 37185093, now seen corresponding path program 1 times [2025-03-17 20:01:59,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:59,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003940127] [2025-03-17 20:01:59,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:59,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:59,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:01:59,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:01:59,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:59,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:59,790 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:59,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:01:59,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:01:59,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:59,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:59,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:59,821 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 [2025-03-17 20:01:59,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:01:59,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:01:59,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:01:59,905 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2025-03-17 20:01:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:01:59,918 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2025-03-17 20:01:59,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2025-03-17 20:01:59,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 20:01:59,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 14 transitions. [2025-03-17 20:01:59,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 20:01:59,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:01:59,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-03-17 20:01:59,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:01:59,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-17 20:01:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-03-17 20:01:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-17 20:01:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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) [2025-03-17 20:01:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-03-17 20:01:59,919 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-17 20:01:59,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:01:59,921 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-17 20:01:59,921 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:01:59,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2025-03-17 20:01:59,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 20:01:59,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:59,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:59,922 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:01:59,922 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:01:59,922 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" [2025-03-17 20:01:59,922 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-03-17 20:01:59,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:59,922 INFO L85 PathProgramCache]: Analyzing trace with hash 42910923, now seen corresponding path program 1 times [2025-03-17 20:01:59,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:59,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011498466] [2025-03-17 20:01:59,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:59,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:59,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:01:59,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:01:59,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:59,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:59,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:59,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:01:59,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:01:59,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:59,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:59,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:59,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:59,948 INFO L85 PathProgramCache]: Analyzing trace with hash 37185093, now seen corresponding path program 2 times [2025-03-17 20:01:59,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:59,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209032373] [2025-03-17 20:01:59,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:59,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:59,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-03-17 20:01:59,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:01:59,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:01:59,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:59,955 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:59,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:01:59,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:01:59,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:59,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:59,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:59,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:59,963 INFO L85 PathProgramCache]: Analyzing trace with hash 922095547, now seen corresponding path program 1 times [2025-03-17 20:01:59,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:59,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707789664] [2025-03-17 20:01:59,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:59,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:59,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 20:01:59,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:01:59,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:59,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 20:02:00,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:00,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707789664] [2025-03-17 20:02:00,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707789664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:00,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189644797] [2025-03-17 20:02:00,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:00,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:00,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:00,090 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:00,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 20:02:00,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 20:02:00,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:02:00,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:00,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:00,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:02:00,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:00,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 20:02:00,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 20:02:00,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189644797] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:00,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:00,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 20:02:00,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772059168] [2025-03-17 20:02:00,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:00,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:00,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 20:02:00,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 20:02:00,274 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 6 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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) [2025-03-17 20:02:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:00,287 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2025-03-17 20:02:00,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2025-03-17 20:02:00,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 20:02:00,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 11 states and 15 transitions. [2025-03-17 20:02:00,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 20:02:00,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:02:00,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2025-03-17 20:02:00,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:00,288 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-17 20:02:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2025-03-17 20:02:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-17 20:02:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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) [2025-03-17 20:02:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-03-17 20:02:00,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-17 20:02:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 20:02:00,289 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-17 20:02:00,289 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:02:00,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2025-03-17 20:02:00,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 20:02:00,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:00,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:00,290 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2025-03-17 20:02:00,290 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:02:00,290 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" [2025-03-17 20:02:00,290 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-03-17 20:02:00,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1330238654, now seen corresponding path program 2 times [2025-03-17 20:02:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:00,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198172883] [2025-03-17 20:02:00,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:00,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:00,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-17 20:02:00,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:02:00,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:00,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:00,301 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:00,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:02:00,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:02:00,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:00,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:00,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:00,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:00,311 INFO L85 PathProgramCache]: Analyzing trace with hash 37185093, now seen corresponding path program 3 times [2025-03-17 20:02:00,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:00,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516920155] [2025-03-17 20:02:00,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:00,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:00,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 2 equivalence classes. [2025-03-17 20:02:00,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:00,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 20:02:00,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:00,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:00,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:00,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:00,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:00,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:00,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:00,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:00,324 INFO L85 PathProgramCache]: Analyzing trace with hash -562692184, now seen corresponding path program 2 times [2025-03-17 20:02:00,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:00,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656184179] [2025-03-17 20:02:00,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:00,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:00,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 20:02:00,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:00,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:00,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:00,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:00,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:02:00,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:00,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:00,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:00,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:00,606 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:00,606 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:00,607 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:00,607 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:00,607 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:00,607 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:00,607 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:00,607 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:00,607 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration5_Lasso [2025-03-17 20:02:00,607 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:00,607 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:00,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:00,931 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:00,931 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:00,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:00,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:00,934 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) [2025-03-17 20:02:00,936 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 [2025-03-17 20:02:00,936 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 [2025-03-17 20:02:00,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:00,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:00,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:00,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:00,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:00,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:00,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:00,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 20:02:00,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:00,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:00,961 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) [2025-03-17 20:02:00,962 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 [2025-03-17 20:02:00,962 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 [2025-03-17 20:02:00,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:00,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:00,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:00,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:00,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:00,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:00,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:00,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 20:02:00,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:00,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:00,986 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) [2025-03-17 20:02:00,986 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 [2025-03-17 20:02:00,988 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 [2025-03-17 20:02:00,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:00,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:00,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:00,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:01,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:01,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:01,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:01,011 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 [2025-03-17 20:02:01,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:01,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:01,013 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) [2025-03-17 20:02:01,015 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 [2025-03-17 20:02:01,016 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 [2025-03-17 20:02:01,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:01,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:01,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:01,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:01,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:01,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:01,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:01,035 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 [2025-03-17 20:02:01,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:01,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:01,038 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) [2025-03-17 20:02:01,039 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 [2025-03-17 20:02:01,040 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 [2025-03-17 20:02:01,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:01,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:01,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:01,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:01,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:01,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:01,062 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:01,080 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 20:02:01,080 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-17 20:02:01,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:01,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:01,082 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) [2025-03-17 20:02:01,084 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 [2025-03-17 20:02:01,085 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:01,095 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:01,096 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:01,096 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_sort_~x#1.base) ULTIMATE.start_sort_~x#1.offset)_1, v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc9#1.base) 4)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_sort_~x#1.base) ULTIMATE.start_sort_~x#1.offset)_1 - 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc9#1.base) 4)_1 Supporting invariants [] [2025-03-17 20:02:01,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:01,114 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2025-03-17 20:02:01,117 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:02:01,117 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:02:01,117 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x!base,]]] [2025-03-17 20:02:01,117 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:02:01,117 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:02:01,117 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc9!base,]]] [2025-03-17 20:02:01,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:01,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:02:01,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:02:01,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:01,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:01,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 20:02:01,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:01,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:01,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:01,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:01,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:01,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 20:02:01,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:01,202 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 [2025-03-17 20:02:01,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 25 [2025-03-17 20:02:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:01,300 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2025-03-17 20:02:01,300 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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) [2025-03-17 20:02:01,363 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 29 states and 40 transitions. Complement of second has 10 states. [2025-03-17 20:02:01,364 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 [2025-03-17 20:02:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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) [2025-03-17 20:02:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2025-03-17 20:02:01,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 6 letters. Loop has 5 letters. [2025-03-17 20:02:01,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:01,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 11 letters. Loop has 5 letters. [2025-03-17 20:02:01,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:01,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 6 letters. Loop has 10 letters. [2025-03-17 20:02:01,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:01,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2025-03-17 20:02:01,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-17 20:02:01,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 40 transitions. [2025-03-17 20:02:01,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-03-17 20:02:01,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-17 20:02:01,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2025-03-17 20:02:01,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:01,367 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 40 transitions. [2025-03-17 20:02:01,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2025-03-17 20:02:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2025-03-17 20:02:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 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) [2025-03-17 20:02:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2025-03-17 20:02:01,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 35 transitions. [2025-03-17 20:02:01,369 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2025-03-17 20:02:01,369 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:02:01,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2025-03-17 20:02:01,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-17 20:02:01,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:01,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:01,370 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-03-17 20:02:01,370 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:02:01,370 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" [2025-03-17 20:02:01,370 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" [2025-03-17 20:02:01,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:01,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1712274677, now seen corresponding path program 1 times [2025-03-17 20:02:01,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:01,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053747244] [2025-03-17 20:02:01,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:01,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:01,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:02:01,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:02:01,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:01,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:01,379 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:01,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:02:01,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:02:01,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:01,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:01,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:01,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:01,386 INFO L85 PathProgramCache]: Analyzing trace with hash 36230794, now seen corresponding path program 1 times [2025-03-17 20:02:01,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:01,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575117768] [2025-03-17 20:02:01,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:01,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:01,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:01,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:01,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:01,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:01,389 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:01,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:01,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:01,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:01,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:01,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:01,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:01,393 INFO L85 PathProgramCache]: Analyzing trace with hash -263558720, now seen corresponding path program 1 times [2025-03-17 20:02:01,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:01,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594485480] [2025-03-17 20:02:01,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:01,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:01,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:01,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:01,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:01,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 20:02:01,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:01,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594485480] [2025-03-17 20:02:01,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594485480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:01,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927800964] [2025-03-17 20:02:01,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:01,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:01,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:01,463 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:01,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-17 20:02:01,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:01,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:01,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:01,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:01,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 20:02:01,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 20:02:01,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 20:02:01,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927800964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:01,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:01,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-17 20:02:01,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944968878] [2025-03-17 20:02:01,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:01,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:01,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 20:02:01,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 20:02:01,638 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. cyclomatic complexity: 14 Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 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) [2025-03-17 20:02:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:01,674 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2025-03-17 20:02:01,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 60 transitions. [2025-03-17 20:02:01,675 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2025-03-17 20:02:01,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 52 transitions. [2025-03-17 20:02:01,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-17 20:02:01,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-17 20:02:01,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 52 transitions. [2025-03-17 20:02:01,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:01,675 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 52 transitions. [2025-03-17 20:02:01,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 52 transitions. [2025-03-17 20:02:01,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2025-03-17 20:02:01,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 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) [2025-03-17 20:02:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2025-03-17 20:02:01,677 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 47 transitions. [2025-03-17 20:02:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:02:01,678 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2025-03-17 20:02:01,678 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:02:01,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 47 transitions. [2025-03-17 20:02:01,679 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2025-03-17 20:02:01,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:01,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:01,679 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1] [2025-03-17 20:02:01,679 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:02:01,679 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" [2025-03-17 20:02:01,679 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" [2025-03-17 20:02:01,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:01,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1540906434, now seen corresponding path program 2 times [2025-03-17 20:02:01,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:01,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886498603] [2025-03-17 20:02:01,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:01,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:01,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-17 20:02:01,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:02:01,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:01,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:01,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:01,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:02:01,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:02:01,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:01,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:01,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:01,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:01,695 INFO L85 PathProgramCache]: Analyzing trace with hash 36230794, now seen corresponding path program 2 times [2025-03-17 20:02:01,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:01,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748644126] [2025-03-17 20:02:01,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:01,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:01,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-03-17 20:02:01,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:01,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:01,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:01,698 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:01,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:01,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:01,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:01,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:01,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:01,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1215425939, now seen corresponding path program 2 times [2025-03-17 20:02:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267791176] [2025-03-17 20:02:01,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:01,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:01,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 20:02:01,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:02:01,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:01,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:01,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:01,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267791176] [2025-03-17 20:02:01,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267791176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:01,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005572381] [2025-03-17 20:02:01,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:01,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:01,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:01,822 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:01,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 20:02:01,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 20:02:01,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:02:01,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:01,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:01,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:01,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:01,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:01,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005572381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:01,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:01,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-17 20:02:01,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673555392] [2025-03-17 20:02:01,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:02,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:02,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 20:02:02,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-17 20:02:02,064 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. cyclomatic complexity: 18 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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) [2025-03-17 20:02:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:02,165 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2025-03-17 20:02:02,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 78 transitions. [2025-03-17 20:02:02,166 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-03-17 20:02:02,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 78 transitions. [2025-03-17 20:02:02,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-17 20:02:02,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-03-17 20:02:02,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 78 transitions. [2025-03-17 20:02:02,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:02,168 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 78 transitions. [2025-03-17 20:02:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 78 transitions. [2025-03-17 20:02:02,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2025-03-17 20:02:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 42 states have internal predecessors, (58), 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) [2025-03-17 20:02:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2025-03-17 20:02:02,171 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 58 transitions. [2025-03-17 20:02:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 20:02:02,173 INFO L432 stractBuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2025-03-17 20:02:02,173 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 20:02:02,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2025-03-17 20:02:02,173 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2025-03-17 20:02:02,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:02,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:02,175 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:02,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:02:02,175 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" [2025-03-17 20:02:02,175 INFO L754 eck$LassoCheckResult]: Loop: "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" [2025-03-17 20:02:02,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash -523489975, now seen corresponding path program 1 times [2025-03-17 20:02:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:02,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819002498] [2025-03-17 20:02:02,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:02,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:02:02,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:02:02,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:02,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:02,191 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:02,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:02:02,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:02:02,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:02,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:02,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:02,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:02,205 INFO L85 PathProgramCache]: Analyzing trace with hash 34850, now seen corresponding path program 1 times [2025-03-17 20:02:02,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:02,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89770253] [2025-03-17 20:02:02,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:02,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:02,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:02,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:02,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:02,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:02,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:02,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:02,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:02,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:02,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:02,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:02,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:02,217 INFO L85 PathProgramCache]: Analyzing trace with hash -263588390, now seen corresponding path program 1 times [2025-03-17 20:02:02,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:02,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933630137] [2025-03-17 20:02:02,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:02,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:02,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:02,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:02,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:02,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:02,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:02,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933630137] [2025-03-17 20:02:02,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933630137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:02,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321017546] [2025-03-17 20:02:02,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:02,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:02,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:02,336 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:02,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-17 20:02:02,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:02,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:02,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:02,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:02,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:02,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:02,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:02,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321017546] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:02,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:02,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-17 20:02:02,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880710747] [2025-03-17 20:02:02,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:02,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:02,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 20:02:02,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-17 20:02:02,570 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 20 Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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) [2025-03-17 20:02:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:02,615 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2025-03-17 20:02:02,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 55 transitions. [2025-03-17 20:02:02,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-17 20:02:02,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 35 states and 47 transitions. [2025-03-17 20:02:02,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-03-17 20:02:02,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-03-17 20:02:02,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2025-03-17 20:02:02,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:02,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 47 transitions. [2025-03-17 20:02:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2025-03-17 20:02:02,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-17 20:02:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 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) [2025-03-17 20:02:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2025-03-17 20:02:02,618 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 47 transitions. [2025-03-17 20:02:02,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 20:02:02,620 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2025-03-17 20:02:02,620 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 20:02:02,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2025-03-17 20:02:02,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-17 20:02:02,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:02,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:02,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:02,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:02:02,621 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:02,621 INFO L754 eck$LassoCheckResult]: Loop: "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:02,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash 653528415, now seen corresponding path program 2 times [2025-03-17 20:02:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:02,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905054356] [2025-03-17 20:02:02,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:02,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:02,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 20:02:02,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:02,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:02,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:02,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:02,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:02,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:02,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:02,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:02,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:02,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash 36681, now seen corresponding path program 1 times [2025-03-17 20:02:02,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:02,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703877992] [2025-03-17 20:02:02,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:02,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:02,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:02,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:02,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:02,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:02,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:02,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:02,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:02,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:02,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:02,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:02,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash 178265387, now seen corresponding path program 1 times [2025-03-17 20:02:02,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:02,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78271241] [2025-03-17 20:02:02,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:02,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:02,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:02:02,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:02:02,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:02,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:02,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:02,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78271241] [2025-03-17 20:02:02,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78271241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:02,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734940345] [2025-03-17 20:02:02,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:02,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:02,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:02,815 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:02,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-17 20:02:02,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:02:02,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:02:02,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:02,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:02,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 20:02:02,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:02,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:03,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734940345] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:03,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:03,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-17 20:02:03,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949818495] [2025-03-17 20:02:03,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:03,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:03,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 20:02:03,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-03-17 20:02:03,114 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. cyclomatic complexity: 16 Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 19 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) [2025-03-17 20:02:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:03,184 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2025-03-17 20:02:03,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 95 transitions. [2025-03-17 20:02:03,185 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2025-03-17 20:02:03,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 95 transitions. [2025-03-17 20:02:03,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-03-17 20:02:03,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-03-17 20:02:03,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 95 transitions. [2025-03-17 20:02:03,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:03,187 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 95 transitions. [2025-03-17 20:02:03,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 95 transitions. [2025-03-17 20:02:03,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 20:02:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 70 states have internal predecessors, (95), 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) [2025-03-17 20:02:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2025-03-17 20:02:03,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 95 transitions. [2025-03-17 20:02:03,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 20:02:03,193 INFO L432 stractBuchiCegarLoop]: Abstraction has 71 states and 95 transitions. [2025-03-17 20:02:03,193 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 20:02:03,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 95 transitions. [2025-03-17 20:02:03,194 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2025-03-17 20:02:03,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:03,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:03,196 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:03,196 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2025-03-17 20:02:03,196 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:03,196 INFO L754 eck$LassoCheckResult]: Loop: "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:03,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash 653529376, now seen corresponding path program 1 times [2025-03-17 20:02:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:03,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539621534] [2025-03-17 20:02:03,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:03,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:03,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:03,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:03,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:03,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:03,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:03,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:03,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:03,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:03,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:03,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:03,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2067907910, now seen corresponding path program 3 times [2025-03-17 20:02:03,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:03,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959443948] [2025-03-17 20:02:03,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:03,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 3 equivalence classes. [2025-03-17 20:02:03,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:02:03,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 20:02:03,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:03,224 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:03,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:02:03,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:02:03,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:03,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:03,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:03,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash -304199835, now seen corresponding path program 3 times [2025-03-17 20:02:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:03,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244120136] [2025-03-17 20:02:03,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:03,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:03,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-03-17 20:02:03,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 20 statements. [2025-03-17 20:02:03,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 20:02:03,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 20:02:03,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:03,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244120136] [2025-03-17 20:02:03,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244120136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:03,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774359689] [2025-03-17 20:02:03,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:03,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:03,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:03,328 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:03,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-17 20:02:03,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-03-17 20:02:03,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 20 statements. [2025-03-17 20:02:03,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 20:02:03,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:03,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 20:02:03,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 20:02:03,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:03,520 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 20:02:03,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774359689] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:03,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:03,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-17 20:02:03,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436372691] [2025-03-17 20:02:03,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:03,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:03,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 20:02:03,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-17 20:02:03,602 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. cyclomatic complexity: 31 Second operand has 17 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 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) [2025-03-17 20:02:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:03,665 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2025-03-17 20:02:03,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 90 transitions. [2025-03-17 20:02:03,666 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2025-03-17 20:02:03,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 90 transitions. [2025-03-17 20:02:03,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-03-17 20:02:03,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-03-17 20:02:03,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 90 transitions. [2025-03-17 20:02:03,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:03,666 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 90 transitions. [2025-03-17 20:02:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 90 transitions. [2025-03-17 20:02:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2025-03-17 20:02:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.3125) internal successors, (84), 63 states have internal predecessors, (84), 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) [2025-03-17 20:02:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2025-03-17 20:02:03,668 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 84 transitions. [2025-03-17 20:02:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 20:02:03,669 INFO L432 stractBuchiCegarLoop]: Abstraction has 64 states and 84 transitions. [2025-03-17 20:02:03,669 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 20:02:03,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 84 transitions. [2025-03-17 20:02:03,669 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2025-03-17 20:02:03,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:03,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:03,670 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:03,670 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:02:03,670 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" [2025-03-17 20:02:03,670 INFO L754 eck$LassoCheckResult]: Loop: "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" [2025-03-17 20:02:03,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1215455609, now seen corresponding path program 3 times [2025-03-17 20:02:03,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:03,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671546933] [2025-03-17 20:02:03,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:03,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:03,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 3 equivalence classes. [2025-03-17 20:02:03,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:02:03,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 20:02:03,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:03,685 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:03,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:02:03,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:02:03,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:03,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:03,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:03,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:03,693 INFO L85 PathProgramCache]: Analyzing trace with hash 33374823, now seen corresponding path program 4 times [2025-03-17 20:02:03,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:03,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968542773] [2025-03-17 20:02:03,693 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:03,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:03,696 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-03-17 20:02:03,697 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:03,697 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:03,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:03,697 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:03,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:03,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:03,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:03,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:03,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:03,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:03,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2095826849, now seen corresponding path program 3 times [2025-03-17 20:02:03,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:03,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460671610] [2025-03-17 20:02:03,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:03,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 4 equivalence classes. [2025-03-17 20:02:03,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:02:03,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 20:02:03,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:03,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:03,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:02:03,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:02:03,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:03,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:03,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:04,317 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:04,318 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:04,318 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:04,318 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:04,318 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:04,318 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,318 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:04,318 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:04,318 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration11_Lasso [2025-03-17 20:02:04,318 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:04,318 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:04,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,600 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:04,600 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:04,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,602 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) [2025-03-17 20:02:04,603 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 [2025-03-17 20:02:04,604 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 [2025-03-17 20:02:04,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,620 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 [2025-03-17 20:02:04,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,622 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) [2025-03-17 20:02:04,622 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 [2025-03-17 20:02:04,624 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 [2025-03-17 20:02:04,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,639 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 [2025-03-17 20:02:04,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,641 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) [2025-03-17 20:02:04,642 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 [2025-03-17 20:02:04,643 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 [2025-03-17 20:02:04,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,660 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 [2025-03-17 20:02:04,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,662 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) [2025-03-17 20:02:04,663 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 [2025-03-17 20:02:04,664 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 [2025-03-17 20:02:04,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:04,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:04,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:04,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,685 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) [2025-03-17 20:02:04,685 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 [2025-03-17 20:02:04,687 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 [2025-03-17 20:02:04,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 20:02:04,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,705 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) [2025-03-17 20:02:04,705 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 [2025-03-17 20:02:04,706 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 [2025-03-17 20:02:04,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,717 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,723 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 [2025-03-17 20:02:04,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,725 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:04,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 20:02:04,726 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 [2025-03-17 20:02:04,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 20:02:04,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,744 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:04,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 20:02:04,745 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 [2025-03-17 20:02:04,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,756 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-17 20:02:04,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,763 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) [2025-03-17 20:02:04,764 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 [2025-03-17 20:02:04,765 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 [2025-03-17 20:02:04,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:04,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,784 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) [2025-03-17 20:02:04,784 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 [2025-03-17 20:02:04,786 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 [2025-03-17 20:02:04,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,797 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,802 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 [2025-03-17 20:02:04,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,804 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) [2025-03-17 20:02:04,804 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 [2025-03-17 20:02:04,806 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 [2025-03-17 20:02:04,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,821 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 [2025-03-17 20:02:04,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,823 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) [2025-03-17 20:02:04,824 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 [2025-03-17 20:02:04,825 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 [2025-03-17 20:02:04,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:04,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:04,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-17 20:02:04,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,850 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) [2025-03-17 20:02:04,851 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 [2025-03-17 20:02:04,852 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 [2025-03-17 20:02:04,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:04,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,871 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) [2025-03-17 20:02:04,872 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 [2025-03-17 20:02:04,873 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 [2025-03-17 20:02:04,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:04,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,892 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) [2025-03-17 20:02:04,893 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 [2025-03-17 20:02:04,895 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 [2025-03-17 20:02:04,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,911 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 [2025-03-17 20:02:04,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,913 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) [2025-03-17 20:02:04,914 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 [2025-03-17 20:02:04,914 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 [2025-03-17 20:02:04,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,930 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 [2025-03-17 20:02:04,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,932 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) [2025-03-17 20:02:04,933 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 [2025-03-17 20:02:04,934 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 [2025-03-17 20:02:04,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:04,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:04,956 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:04,977 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-17 20:02:04,977 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-03-17 20:02:04,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,980 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:04,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-17 20:02:04,981 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:04,992 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:04,992 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:04,992 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1) = 1*ULTIMATE.start_sort_~i~0#1 Supporting invariants [] [2025-03-17 20:02:05,003 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 [2025-03-17 20:02:05,015 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-17 20:02:05,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:05,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:02:05,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:02:05,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:05,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:05,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:05,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:05,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:05,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:05,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:05,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:05,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:02:05,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:05,088 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-03-17 20:02:05,088 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 84 transitions. cyclomatic complexity: 27 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) [2025-03-17 20:02:05,112 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 84 transitions. cyclomatic complexity: 27. 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 182 states and 239 transitions. Complement of second has 9 states. [2025-03-17 20:02:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:05,113 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) [2025-03-17 20:02:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2025-03-17 20:02:05,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 13 letters. Loop has 5 letters. [2025-03-17 20:02:05,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:05,113 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:05,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:05,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:02:05,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:02:05,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:05,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:05,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:05,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:05,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:05,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:05,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:05,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:05,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:02:05,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:05,179 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2025-03-17 20:02:05,179 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 84 transitions. cyclomatic complexity: 27 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) [2025-03-17 20:02:05,236 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 84 transitions. cyclomatic complexity: 27. 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 212 states and 277 transitions. Complement of second has 13 states. [2025-03-17 20:02:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:05,237 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) [2025-03-17 20:02:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2025-03-17 20:02:05,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 13 letters. Loop has 5 letters. [2025-03-17 20:02:05,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:05,237 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:05,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:05,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:02:05,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:02:05,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:05,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:05,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:05,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:05,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:05,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:05,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:05,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:05,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:02:05,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:05,305 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 4 loop predicates [2025-03-17 20:02:05,306 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 84 transitions. cyclomatic complexity: 27 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) [2025-03-17 20:02:05,328 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 84 transitions. cyclomatic complexity: 27. 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 159 states and 209 transitions. Complement of second has 12 states. [2025-03-17 20:02:05,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:05,329 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) [2025-03-17 20:02:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2025-03-17 20:02:05,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 13 letters. Loop has 5 letters. [2025-03-17 20:02:05,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:05,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 18 letters. Loop has 5 letters. [2025-03-17 20:02:05,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:05,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 13 letters. Loop has 10 letters. [2025-03-17 20:02:05,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:05,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 209 transitions. [2025-03-17 20:02:05,332 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2025-03-17 20:02:05,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 93 states and 122 transitions. [2025-03-17 20:02:05,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2025-03-17 20:02:05,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-03-17 20:02:05,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 122 transitions. [2025-03-17 20:02:05,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:05,333 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 122 transitions. [2025-03-17 20:02:05,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 122 transitions. [2025-03-17 20:02:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 67. [2025-03-17 20:02:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 66 states have internal predecessors, (91), 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) [2025-03-17 20:02:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2025-03-17 20:02:05,335 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 91 transitions. [2025-03-17 20:02:05,336 INFO L432 stractBuchiCegarLoop]: Abstraction has 67 states and 91 transitions. [2025-03-17 20:02:05,336 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 20:02:05,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 91 transitions. [2025-03-17 20:02:05,336 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2025-03-17 20:02:05,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:05,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:05,336 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:05,336 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:02:05,337 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" [2025-03-17 20:02:05,337 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" [2025-03-17 20:02:05,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash -533107767, now seen corresponding path program 4 times [2025-03-17 20:02:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:05,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18393401] [2025-03-17 20:02:05,337 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:05,341 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 11 statements into 2 equivalence classes. [2025-03-17 20:02:05,346 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:05,347 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:05,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:05,347 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:05,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:02:05,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:05,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:05,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:05,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:05,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:05,354 INFO L85 PathProgramCache]: Analyzing trace with hash 36230794, now seen corresponding path program 4 times [2025-03-17 20:02:05,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:05,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123435649] [2025-03-17 20:02:05,354 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:05,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:05,356 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-03-17 20:02:05,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:05,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:05,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:05,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:05,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:05,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:05,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:05,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:05,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:05,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:05,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1231259586, now seen corresponding path program 1 times [2025-03-17 20:02:05,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:05,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764873069] [2025-03-17 20:02:05,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:05,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:05,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:02:05,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:02:05,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:05,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:05,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:05,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:02:05,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:02:05,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:05,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:05,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:05,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-17 20:02:05,834 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:05,835 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:05,835 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:05,835 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:05,835 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:05,835 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,835 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:05,835 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:05,835 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration12_Lasso [2025-03-17 20:02:05,835 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:05,835 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:05,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:05,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:06,153 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:06,153 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:06,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,155 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:06,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-17 20:02:06,157 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 [2025-03-17 20:02:06,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:06,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:06,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:06,169 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:06,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,176 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:06,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-17 20:02:06,178 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 [2025-03-17 20:02:06,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:06,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:06,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:06,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-17 20:02:06,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,196 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:06,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-17 20:02:06,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:06,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:06,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:06,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:06,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-17 20:02:06,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,216 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:06,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-17 20:02:06,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:06,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:06,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:06,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:06,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:06,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,236 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:06,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-17 20:02:06,238 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 [2025-03-17 20:02:06,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:06,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:06,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:06,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-17 20:02:06,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,256 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:06,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-17 20:02:06,258 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 [2025-03-17 20:02:06,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:06,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:06,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:06,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-17 20:02:06,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,277 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:06,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-17 20:02:06,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 [2025-03-17 20:02:06,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:06,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:06,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:06,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-17 20:02:06,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,297 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:06,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-17 20:02:06,299 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 [2025-03-17 20:02:06,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:06,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:06,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:06,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-17 20:02:06,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,317 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:06,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-17 20:02:06,319 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 [2025-03-17 20:02:06,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:06,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:06,332 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-17 20:02:06,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,339 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:06,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-17 20:02:06,341 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 [2025-03-17 20:02:06,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:06,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:06,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:06,352 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-17 20:02:06,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,360 INFO L229 MonitoredProcess]: Starting monitored process 55 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) [2025-03-17 20:02:06,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-17 20:02:06,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 [2025-03-17 20:02:06,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:06,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:06,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:06,372 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-17 20:02:06,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,380 INFO L229 MonitoredProcess]: Starting monitored process 56 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) [2025-03-17 20:02:06,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-17 20:02:06,381 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 [2025-03-17 20:02:06,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:06,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:06,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:06,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-17 20:02:06,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,400 INFO L229 MonitoredProcess]: Starting monitored process 57 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) [2025-03-17 20:02:06,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-17 20:02:06,403 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 [2025-03-17 20:02:06,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:06,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:06,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:06,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:06,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,421 INFO L229 MonitoredProcess]: Starting monitored process 58 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) [2025-03-17 20:02:06,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-17 20:02:06,423 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 [2025-03-17 20:02:06,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:06,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:06,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:06,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-17 20:02:06,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,440 INFO L229 MonitoredProcess]: Starting monitored process 59 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) [2025-03-17 20:02:06,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-17 20:02:06,442 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 [2025-03-17 20:02:06,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:06,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:06,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:06,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-17 20:02:06,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,462 INFO L229 MonitoredProcess]: Starting monitored process 60 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) [2025-03-17 20:02:06,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-17 20:02:06,463 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 [2025-03-17 20:02:06,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:06,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:06,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:06,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:06,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:06,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:06,485 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:06,502 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-17 20:02:06,503 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. [2025-03-17 20:02:06,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:06,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:06,504 INFO L229 MonitoredProcess]: Starting monitored process 61 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) [2025-03-17 20:02:06,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-17 20:02:06,506 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:06,516 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:06,516 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:06,516 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1) = 1*ULTIMATE.start_sort_~i~0#1 Supporting invariants [] [2025-03-17 20:02:06,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-17 20:02:06,529 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-03-17 20:02:06,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:06,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:02:06,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:06,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:06,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:06,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:06,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:06,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:06,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:06,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:06,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:06,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:02:06,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:06,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:06,579 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 20:02:06,579 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 91 transitions. cyclomatic complexity: 30 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2025-03-17 20:02:06,599 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 91 transitions. cyclomatic complexity: 30. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 171 states and 235 transitions. Complement of second has 9 states. [2025-03-17 20:02:06,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2025-03-17 20:02:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2025-03-17 20:02:06,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 11 letters. Loop has 5 letters. [2025-03-17 20:02:06,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:06,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 16 letters. Loop has 5 letters. [2025-03-17 20:02:06,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:06,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 11 letters. Loop has 10 letters. [2025-03-17 20:02:06,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:06,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 235 transitions. [2025-03-17 20:02:06,602 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2025-03-17 20:02:06,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 121 states and 167 transitions. [2025-03-17 20:02:06,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-03-17 20:02:06,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2025-03-17 20:02:06,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 167 transitions. [2025-03-17 20:02:06,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:06,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 121 states and 167 transitions. [2025-03-17 20:02:06,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 167 transitions. [2025-03-17 20:02:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 67. [2025-03-17 20:02:06,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 66 states have internal predecessors, (95), 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) [2025-03-17 20:02:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2025-03-17 20:02:06,605 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 95 transitions. [2025-03-17 20:02:06,605 INFO L432 stractBuchiCegarLoop]: Abstraction has 67 states and 95 transitions. [2025-03-17 20:02:06,605 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 20:02:06,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 95 transitions. [2025-03-17 20:02:06,605 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2025-03-17 20:02:06,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:06,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:06,605 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:06,605 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2025-03-17 20:02:06,605 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" [2025-03-17 20:02:06,605 INFO L754 eck$LassoCheckResult]: Loop: "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" [2025-03-17 20:02:06,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash -658568326, now seen corresponding path program 5 times [2025-03-17 20:02:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:06,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113183871] [2025-03-17 20:02:06,608 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:06,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:06,613 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 3 equivalence classes. [2025-03-17 20:02:06,622 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:02:06,622 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 20:02:06,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:06,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:06,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:02:06,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:02:06,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:06,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:06,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:06,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:06,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1298245350, now seen corresponding path program 5 times [2025-03-17 20:02:06,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:06,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775291067] [2025-03-17 20:02:06,635 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:06,639 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-17 20:02:06,640 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:02:06,640 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:06,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:06,640 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:06,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:02:06,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:02:06,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:06,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:06,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:06,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:06,646 INFO L85 PathProgramCache]: Analyzing trace with hash -63035041, now seen corresponding path program 4 times [2025-03-17 20:02:06,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:06,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107331655] [2025-03-17 20:02:06,646 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:06,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:06,652 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-17 20:02:06,667 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:02:06,667 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:06,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:06,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:06,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 20:02:06,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:02:06,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:06,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:06,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:07,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-17 20:02:07,575 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:07,575 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:07,575 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:07,575 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:07,575 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:07,575 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:07,575 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:07,575 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:07,575 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration13_Lasso [2025-03-17 20:02:07,575 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:07,575 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:07,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:07,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:08,061 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:08,061 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:08,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,063 INFO L229 MonitoredProcess]: Starting monitored process 62 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) [2025-03-17 20:02:08,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-17 20:02:08,064 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 [2025-03-17 20:02:08,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:08,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:08,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:08,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:08,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,081 INFO L229 MonitoredProcess]: Starting monitored process 63 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) [2025-03-17 20:02:08,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-17 20:02:08,083 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 [2025-03-17 20:02:08,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:08,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:08,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:08,093 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-17 20:02:08,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,100 INFO L229 MonitoredProcess]: Starting monitored process 64 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) [2025-03-17 20:02:08,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-17 20:02:08,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:08,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:08,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:08,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:08,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-17 20:02:08,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,118 INFO L229 MonitoredProcess]: Starting monitored process 65 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) [2025-03-17 20:02:08,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-17 20:02:08,119 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 [2025-03-17 20:02:08,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:08,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:08,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-17 20:02:08,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,138 INFO L229 MonitoredProcess]: Starting monitored process 66 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) [2025-03-17 20:02:08,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-17 20:02:08,140 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 [2025-03-17 20:02:08,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:08,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:08,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:08,152 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-17 20:02:08,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,159 INFO L229 MonitoredProcess]: Starting monitored process 67 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) [2025-03-17 20:02:08,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-17 20:02:08,161 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 [2025-03-17 20:02:08,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:08,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:08,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:08,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:08,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,180 INFO L229 MonitoredProcess]: Starting monitored process 68 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) [2025-03-17 20:02:08,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-17 20:02:08,181 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 [2025-03-17 20:02:08,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:08,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:08,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:08,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-17 20:02:08,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,199 INFO L229 MonitoredProcess]: Starting monitored process 69 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) [2025-03-17 20:02:08,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-17 20:02:08,200 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 [2025-03-17 20:02:08,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:08,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:08,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:08,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-17 20:02:08,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,218 INFO L229 MonitoredProcess]: Starting monitored process 70 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) [2025-03-17 20:02:08,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-17 20:02:08,220 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 [2025-03-17 20:02:08,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:08,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:08,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:08,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-17 20:02:08,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,238 INFO L229 MonitoredProcess]: Starting monitored process 71 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) [2025-03-17 20:02:08,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-17 20:02:08,240 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 [2025-03-17 20:02:08,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:08,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:08,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:08,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:08,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,258 INFO L229 MonitoredProcess]: Starting monitored process 72 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) [2025-03-17 20:02:08,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-17 20:02:08,259 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 [2025-03-17 20:02:08,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:08,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:08,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:08,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-17 20:02:08,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,277 INFO L229 MonitoredProcess]: Starting monitored process 73 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) [2025-03-17 20:02:08,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-17 20:02:08,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 [2025-03-17 20:02:08,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:08,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:08,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:08,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-17 20:02:08,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,295 INFO L229 MonitoredProcess]: Starting monitored process 74 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) [2025-03-17 20:02:08,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-17 20:02:08,296 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 [2025-03-17 20:02:08,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:08,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:08,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:08,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-17 20:02:08,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,313 INFO L229 MonitoredProcess]: Starting monitored process 75 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) [2025-03-17 20:02:08,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-17 20:02:08,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:08,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:08,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:08,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-17 20:02:08,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,334 INFO L229 MonitoredProcess]: Starting monitored process 76 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) [2025-03-17 20:02:08,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-17 20:02:08,339 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 [2025-03-17 20:02:08,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:08,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:08,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:08,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-17 20:02:08,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,356 INFO L229 MonitoredProcess]: Starting monitored process 77 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) [2025-03-17 20:02:08,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-17 20:02:08,357 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 [2025-03-17 20:02:08,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:08,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:08,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:08,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-17 20:02:08,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,376 INFO L229 MonitoredProcess]: Starting monitored process 78 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) [2025-03-17 20:02:08,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-17 20:02:08,377 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 [2025-03-17 20:02:08,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:08,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:08,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:08,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-17 20:02:08,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,398 INFO L229 MonitoredProcess]: Starting monitored process 79 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) [2025-03-17 20:02:08,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-17 20:02:08,400 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 [2025-03-17 20:02:08,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:08,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:08,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:08,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:08,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:08,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:08,420 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:08,436 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-03-17 20:02:08,436 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-03-17 20:02:08,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:08,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:08,438 INFO L229 MonitoredProcess]: Starting monitored process 80 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) [2025-03-17 20:02:08,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-17 20:02:08,439 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:08,449 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:08,449 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:08,449 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0#1, ULTIMATE.start_sort_~n#1) = -1*ULTIMATE.start_sort_~pass~0#1 + 1*ULTIMATE.start_sort_~n#1 Supporting invariants [] [2025-03-17 20:02:08,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-17 20:02:08,467 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2025-03-17 20:02:08,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:08,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:02:08,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:02:08,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:08,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:08,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:08,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:08,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:02:08,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:02:08,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:08,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:08,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:02:08,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:08,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 20:02:08,552 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 20:02:08,552 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 95 transitions. cyclomatic complexity: 33 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2025-03-17 20:02:08,566 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 95 transitions. cyclomatic complexity: 33. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 166 states and 257 transitions. Complement of second has 6 states. [2025-03-17 20:02:08,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2025-03-17 20:02:08,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2025-03-17 20:02:08,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 14 letters. Loop has 8 letters. [2025-03-17 20:02:08,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:08,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 22 letters. Loop has 8 letters. [2025-03-17 20:02:08,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:08,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 14 letters. Loop has 16 letters. [2025-03-17 20:02:08,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:08,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 257 transitions. [2025-03-17 20:02:08,569 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2025-03-17 20:02:08,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 138 states and 205 transitions. [2025-03-17 20:02:08,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-03-17 20:02:08,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2025-03-17 20:02:08,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 205 transitions. [2025-03-17 20:02:08,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:08,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 205 transitions. [2025-03-17 20:02:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 205 transitions. [2025-03-17 20:02:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2025-03-17 20:02:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.5169491525423728) internal successors, (179), 117 states have internal predecessors, (179), 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) [2025-03-17 20:02:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 179 transitions. [2025-03-17 20:02:08,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 179 transitions. [2025-03-17 20:02:08,576 INFO L432 stractBuchiCegarLoop]: Abstraction has 118 states and 179 transitions. [2025-03-17 20:02:08,576 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 20:02:08,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 179 transitions. [2025-03-17 20:02:08,577 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 20:02:08,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:08,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:08,578 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:08,578 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:02:08,578 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" [2025-03-17 20:02:08,578 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" [2025-03-17 20:02:08,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:08,579 INFO L85 PathProgramCache]: Analyzing trace with hash 683112828, now seen corresponding path program 6 times [2025-03-17 20:02:08,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:08,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573995788] [2025-03-17 20:02:08,579 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:02:08,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:08,585 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 12 statements into 3 equivalence classes. [2025-03-17 20:02:08,590 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:08,590 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 20:02:08,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:08,590 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:08,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:08,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:08,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:08,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:08,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:08,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:08,597 INFO L85 PathProgramCache]: Analyzing trace with hash 37670, now seen corresponding path program 2 times [2025-03-17 20:02:08,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:08,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375440083] [2025-03-17 20:02:08,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:08,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:08,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:08,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:08,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:02:08,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:08,601 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:08,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:08,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:08,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:08,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:08,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:08,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:08,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1059218379, now seen corresponding path program 7 times [2025-03-17 20:02:08,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:08,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028021183] [2025-03-17 20:02:08,604 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:02:08,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:08,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:02:08,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:02:08,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:08,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:08,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:08,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:02:08,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:02:08,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:08,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:08,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:09,127 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:09,128 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:09,128 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:09,128 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:09,128 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:09,128 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,128 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:09,128 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:09,128 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration14_Lasso [2025-03-17 20:02:09,128 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:09,128 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:09,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:09,487 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:09,487 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:09,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,489 INFO L229 MonitoredProcess]: Starting monitored process 81 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) [2025-03-17 20:02:09,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-17 20:02:09,491 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 [2025-03-17 20:02:09,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-17 20:02:09,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,508 INFO L229 MonitoredProcess]: Starting monitored process 82 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) [2025-03-17 20:02:09,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-17 20:02:09,510 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 [2025-03-17 20:02:09,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-17 20:02:09,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,527 INFO L229 MonitoredProcess]: Starting monitored process 83 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) [2025-03-17 20:02:09,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-17 20:02:09,529 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 [2025-03-17 20:02:09,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-17 20:02:09,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,547 INFO L229 MonitoredProcess]: Starting monitored process 84 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) [2025-03-17 20:02:09,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-17 20:02:09,548 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 [2025-03-17 20:02:09,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-17 20:02:09,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,600 INFO L229 MonitoredProcess]: Starting monitored process 85 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) [2025-03-17 20:02:09,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-17 20:02:09,601 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 [2025-03-17 20:02:09,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:09,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,622 INFO L229 MonitoredProcess]: Starting monitored process 86 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) [2025-03-17 20:02:09,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-17 20:02:09,623 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 [2025-03-17 20:02:09,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-03-17 20:02:09,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,640 INFO L229 MonitoredProcess]: Starting monitored process 87 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) [2025-03-17 20:02:09,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-17 20:02:09,642 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 [2025-03-17 20:02:09,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:09,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:09,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-17 20:02:09,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,662 INFO L229 MonitoredProcess]: Starting monitored process 88 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) [2025-03-17 20:02:09,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-03-17 20:02:09,663 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 [2025-03-17 20:02:09,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-03-17 20:02:09,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,681 INFO L229 MonitoredProcess]: Starting monitored process 89 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) [2025-03-17 20:02:09,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-03-17 20:02:09,683 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 [2025-03-17 20:02:09,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:09,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,701 INFO L229 MonitoredProcess]: Starting monitored process 90 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) [2025-03-17 20:02:09,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-03-17 20:02:09,702 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 [2025-03-17 20:02:09,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,713 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-03-17 20:02:09,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,720 INFO L229 MonitoredProcess]: Starting monitored process 91 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) [2025-03-17 20:02:09,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-03-17 20:02:09,722 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 [2025-03-17 20:02:09,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,732 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-03-17 20:02:09,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,739 INFO L229 MonitoredProcess]: Starting monitored process 92 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) [2025-03-17 20:02:09,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-03-17 20:02:09,741 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 [2025-03-17 20:02:09,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-03-17 20:02:09,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,759 INFO L229 MonitoredProcess]: Starting monitored process 93 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) [2025-03-17 20:02:09,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-03-17 20:02:09,760 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 [2025-03-17 20:02:09,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,771 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-03-17 20:02:09,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,779 INFO L229 MonitoredProcess]: Starting monitored process 94 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) [2025-03-17 20:02:09,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-03-17 20:02:09,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 [2025-03-17 20:02:09,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:09,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,798 INFO L229 MonitoredProcess]: Starting monitored process 95 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) [2025-03-17 20:02:09,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-03-17 20:02:09,812 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 [2025-03-17 20:02:09,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,823 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-03-17 20:02:09,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,830 INFO L229 MonitoredProcess]: Starting monitored process 96 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) [2025-03-17 20:02:09,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-03-17 20:02:09,831 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 [2025-03-17 20:02:09,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:09,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:09,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-03-17 20:02:09,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,850 INFO L229 MonitoredProcess]: Starting monitored process 97 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) [2025-03-17 20:02:09,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-03-17 20:02:09,851 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 [2025-03-17 20:02:09,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,862 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-03-17 20:02:09,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,869 INFO L229 MonitoredProcess]: Starting monitored process 98 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) [2025-03-17 20:02:09,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-03-17 20:02:09,870 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 [2025-03-17 20:02:09,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:09,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:09,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-03-17 20:02:09,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,897 INFO L229 MonitoredProcess]: Starting monitored process 99 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) [2025-03-17 20:02:09,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-03-17 20:02:09,899 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 [2025-03-17 20:02:09,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:09,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:09,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-03-17 20:02:09,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,919 INFO L229 MonitoredProcess]: Starting monitored process 100 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) [2025-03-17 20:02:09,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-03-17 20:02:09,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 [2025-03-17 20:02:09,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:09,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:09,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-03-17 20:02:09,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,941 INFO L229 MonitoredProcess]: Starting monitored process 101 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) [2025-03-17 20:02:09,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-03-17 20:02:09,942 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 [2025-03-17 20:02:09,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:09,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:09,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-03-17 20:02:09,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,964 INFO L229 MonitoredProcess]: Starting monitored process 102 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) [2025-03-17 20:02:09,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-03-17 20:02:09,965 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 [2025-03-17 20:02:09,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:09,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:09,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:09,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:09,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-03-17 20:02:09,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:09,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:09,983 INFO L229 MonitoredProcess]: Starting monitored process 103 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) [2025-03-17 20:02:09,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-03-17 20:02:09,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:09,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:09,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:09,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:09,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:09,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:09,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:09,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:10,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-03-17 20:02:10,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:10,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:10,004 INFO L229 MonitoredProcess]: Starting monitored process 104 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) [2025-03-17 20:02:10,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-03-17 20:02:10,006 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 [2025-03-17 20:02:10,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:10,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:10,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:10,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:10,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:10,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:10,025 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:10,035 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-17 20:02:10,035 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-03-17 20:02:10,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:10,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:10,037 INFO L229 MonitoredProcess]: Starting monitored process 105 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) [2025-03-17 20:02:10,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-03-17 20:02:10,038 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:10,052 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:10,053 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:10,053 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~x#1.offset, v_rep(select #length ULTIMATE.start_sort_~x#1.base)_5, ULTIMATE.start_sort_~i~0#1) = -1*ULTIMATE.start_sort_~x#1.offset + 1*v_rep(select #length ULTIMATE.start_sort_~x#1.base)_5 - 4*ULTIMATE.start_sort_~i~0#1 Supporting invariants [] [2025-03-17 20:02:10,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-03-17 20:02:10,064 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-17 20:02:10,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x!offset [2025-03-17 20:02:10,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:02:10,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:02:10,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:10,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:10,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:10,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:10,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:10,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:10,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:10,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:10,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:10,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:10,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:10,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:02:10,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:10,114 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 [2025-03-17 20:02:10,114 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 179 transitions. cyclomatic complexity: 72 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) [2025-03-17 20:02:10,126 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 179 transitions. cyclomatic complexity: 72. 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 202 states and 283 transitions. Complement of second has 5 states. [2025-03-17 20:02:10,127 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 [2025-03-17 20:02:10,127 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) [2025-03-17 20:02:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2025-03-17 20:02:10,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-17 20:02:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 3 letters. [2025-03-17 20:02:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 12 letters. Loop has 6 letters. [2025-03-17 20:02:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:10,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 283 transitions. [2025-03-17 20:02:10,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 20:02:10,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 164 states and 233 transitions. [2025-03-17 20:02:10,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-03-17 20:02:10,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-03-17 20:02:10,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 233 transitions. [2025-03-17 20:02:10,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:10,130 INFO L218 hiAutomatonCegarLoop]: Abstraction has 164 states and 233 transitions. [2025-03-17 20:02:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 233 transitions. [2025-03-17 20:02:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 122. [2025-03-17 20:02:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.5) internal successors, (183), 121 states have internal predecessors, (183), 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) [2025-03-17 20:02:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 183 transitions. [2025-03-17 20:02:10,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 122 states and 183 transitions. [2025-03-17 20:02:10,133 INFO L432 stractBuchiCegarLoop]: Abstraction has 122 states and 183 transitions. [2025-03-17 20:02:10,133 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-17 20:02:10,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 183 transitions. [2025-03-17 20:02:10,134 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 20:02:10,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:10,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:10,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:10,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:02:10,134 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:10,135 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:10,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:10,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1792819543, now seen corresponding path program 2 times [2025-03-17 20:02:10,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:10,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395458956] [2025-03-17 20:02:10,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:10,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:10,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 20:02:10,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:02:10,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:10,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:10,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:10,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395458956] [2025-03-17 20:02:10,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395458956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:10,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378942145] [2025-03-17 20:02:10,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:10,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:10,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:10,351 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:10,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2025-03-17 20:02:10,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 20:02:10,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:02:10,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:10,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:10,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 20:02:10,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:10,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:10,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378942145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:10,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:10,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2025-03-17 20:02:10,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946455432] [2025-03-17 20:02:10,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:10,618 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:02:10,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:10,619 INFO L85 PathProgramCache]: Analyzing trace with hash 35720, now seen corresponding path program 3 times [2025-03-17 20:02:10,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:10,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831697946] [2025-03-17 20:02:10,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:10,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:10,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:10,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:10,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:02:10,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:10,624 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:10,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:10,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:10,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:10,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:10,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:10,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:10,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 20:02:10,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-17 20:02:10,710 INFO L87 Difference]: Start difference. First operand 122 states and 183 transitions. cyclomatic complexity: 73 Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 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) [2025-03-17 20:02:10,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:10,839 INFO L93 Difference]: Finished difference Result 145 states and 201 transitions. [2025-03-17 20:02:10,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 201 transitions. [2025-03-17 20:02:10,840 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 20:02:10,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 129 states and 185 transitions. [2025-03-17 20:02:10,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-17 20:02:10,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-17 20:02:10,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 185 transitions. [2025-03-17 20:02:10,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:10,841 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 185 transitions. [2025-03-17 20:02:10,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 185 transitions. [2025-03-17 20:02:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 97. [2025-03-17 20:02:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 96 states have internal predecessors, (142), 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) [2025-03-17 20:02:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2025-03-17 20:02:10,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 142 transitions. [2025-03-17 20:02:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 20:02:10,849 INFO L432 stractBuchiCegarLoop]: Abstraction has 97 states and 142 transitions. [2025-03-17 20:02:10,849 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-17 20:02:10,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 142 transitions. [2025-03-17 20:02:10,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 20:02:10,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:10,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:10,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:10,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:02:10,850 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-03-17 20:02:10,850 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-03-17 20:02:10,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:10,850 INFO L85 PathProgramCache]: Analyzing trace with hash -228422711, now seen corresponding path program 4 times [2025-03-17 20:02:10,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:10,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865553197] [2025-03-17 20:02:10,850 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:10,858 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-17 20:02:10,867 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 20:02:10,868 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:10,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:10,868 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:10,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 20:02:10,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 20:02:10,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:10,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:10,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:10,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:10,880 INFO L85 PathProgramCache]: Analyzing trace with hash 37186054, now seen corresponding path program 5 times [2025-03-17 20:02:10,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:10,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710524363] [2025-03-17 20:02:10,881 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:10,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:10,883 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-03-17 20:02:10,884 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:10,884 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:10,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:10,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:10,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:10,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:10,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:10,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:10,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:10,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1006830786, now seen corresponding path program 5 times [2025-03-17 20:02:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:10,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953222883] [2025-03-17 20:02:10,887 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:10,891 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 5 equivalence classes. [2025-03-17 20:02:10,899 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 20:02:10,899 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 20:02:10,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:10,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-03-17 20:02:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 20:02:11,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:11,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953222883] [2025-03-17 20:02:11,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953222883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:11,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198484944] [2025-03-17 20:02:11,003 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:11,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:11,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:11,006 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:11,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2025-03-17 20:02:11,057 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 5 equivalence classes. [2025-03-17 20:02:11,077 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 20:02:11,078 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 20:02:11,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:11,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:02:11,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 20:02:11,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 20:02:11,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198484944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:11,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:11,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2025-03-17 20:02:11,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754844027] [2025-03-17 20:02:11,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:11,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:11,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 20:02:11,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 20:02:11,203 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. cyclomatic complexity: 54 Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 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) [2025-03-17 20:02:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:11,296 INFO L93 Difference]: Finished difference Result 200 states and 288 transitions. [2025-03-17 20:02:11,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 288 transitions. [2025-03-17 20:02:11,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2025-03-17 20:02:11,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 195 states and 279 transitions. [2025-03-17 20:02:11,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-03-17 20:02:11,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2025-03-17 20:02:11,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 279 transitions. [2025-03-17 20:02:11,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:11,298 INFO L218 hiAutomatonCegarLoop]: Abstraction has 195 states and 279 transitions. [2025-03-17 20:02:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 279 transitions. [2025-03-17 20:02:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 150. [2025-03-17 20:02:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.46) internal successors, (219), 149 states have internal predecessors, (219), 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) [2025-03-17 20:02:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 219 transitions. [2025-03-17 20:02:11,305 INFO L240 hiAutomatonCegarLoop]: Abstraction has 150 states and 219 transitions. [2025-03-17 20:02:11,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 20:02:11,306 INFO L432 stractBuchiCegarLoop]: Abstraction has 150 states and 219 transitions. [2025-03-17 20:02:11,306 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-17 20:02:11,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 219 transitions. [2025-03-17 20:02:11,306 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2025-03-17 20:02:11,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:11,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:11,307 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:11,307 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1] [2025-03-17 20:02:11,307 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-03-17 20:02:11,307 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-03-17 20:02:11,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:11,307 INFO L85 PathProgramCache]: Analyzing trace with hash -228422711, now seen corresponding path program 6 times [2025-03-17 20:02:11,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:11,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309893064] [2025-03-17 20:02:11,307 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:02:11,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:11,313 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 4 equivalence classes. [2025-03-17 20:02:11,319 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 20:02:11,320 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-17 20:02:11,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:11,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:11,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 20:02:11,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 20:02:11,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:11,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:11,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:11,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:11,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1363518906, now seen corresponding path program 6 times [2025-03-17 20:02:11,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:11,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774491684] [2025-03-17 20:02:11,329 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:02:11,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:11,331 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 11 statements into 4 equivalence classes. [2025-03-17 20:02:11,333 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:11,333 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-17 20:02:11,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:11,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:11,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:02:11,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:11,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:11,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:11,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:11,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:11,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1118577022, now seen corresponding path program 7 times [2025-03-17 20:02:11,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:11,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605091852] [2025-03-17 20:02:11,337 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:02:11,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:11,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 20:02:11,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 20:02:11,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:11,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 20:02:11,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:11,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605091852] [2025-03-17 20:02:11,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605091852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:11,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808605494] [2025-03-17 20:02:11,483 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:02:11,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:11,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:11,485 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:11,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2025-03-17 20:02:11,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 20:02:11,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 20:02:11,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:11,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:11,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 20:02:11,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 20:02:11,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:11,747 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 23 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 20:02:11,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808605494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:11,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:11,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2025-03-17 20:02:11,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701451824] [2025-03-17 20:02:11,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:11,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:11,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 20:02:11,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-17 20:02:11,849 INFO L87 Difference]: Start difference. First operand 150 states and 219 transitions. cyclomatic complexity: 78 Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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) [2025-03-17 20:02:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:11,938 INFO L93 Difference]: Finished difference Result 294 states and 421 transitions. [2025-03-17 20:02:11,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 421 transitions. [2025-03-17 20:02:11,939 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2025-03-17 20:02:11,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 175 states and 247 transitions. [2025-03-17 20:02:11,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2025-03-17 20:02:11,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-03-17 20:02:11,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 247 transitions. [2025-03-17 20:02:11,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:11,940 INFO L218 hiAutomatonCegarLoop]: Abstraction has 175 states and 247 transitions. [2025-03-17 20:02:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 247 transitions. [2025-03-17 20:02:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-17 20:02:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 175 states have (on average 1.4114285714285715) internal successors, (247), 174 states have internal predecessors, (247), 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) [2025-03-17 20:02:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 247 transitions. [2025-03-17 20:02:11,943 INFO L240 hiAutomatonCegarLoop]: Abstraction has 175 states and 247 transitions. [2025-03-17 20:02:11,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 20:02:11,944 INFO L432 stractBuchiCegarLoop]: Abstraction has 175 states and 247 transitions. [2025-03-17 20:02:11,944 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-17 20:02:11,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 247 transitions. [2025-03-17 20:02:11,944 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2025-03-17 20:02:11,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:11,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:11,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:11,945 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1] [2025-03-17 20:02:11,945 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-03-17 20:02:11,945 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-03-17 20:02:11,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash 39663228, now seen corresponding path program 8 times [2025-03-17 20:02:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:11,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730406574] [2025-03-17 20:02:11,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:11,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-17 20:02:11,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:02:11,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:11,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:12,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:12,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730406574] [2025-03-17 20:02:12,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730406574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:12,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909859557] [2025-03-17 20:02:12,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:12,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:12,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:12,070 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:12,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2025-03-17 20:02:12,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-17 20:02:12,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:02:12,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:12,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:12,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 20:02:12,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:12,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:12,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909859557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:12,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:12,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2025-03-17 20:02:12,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354468647] [2025-03-17 20:02:12,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:12,311 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:02:12,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:12,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1363518906, now seen corresponding path program 7 times [2025-03-17 20:02:12,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:12,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010506151] [2025-03-17 20:02:12,312 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:02:12,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:12,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:02:12,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:12,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:12,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:12,316 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:12,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:02:12,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:12,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:12,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:12,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:12,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 20:02:12,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-03-17 20:02:12,428 INFO L87 Difference]: Start difference. First operand 175 states and 247 transitions. cyclomatic complexity: 83 Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 20 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) [2025-03-17 20:02:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:12,519 INFO L93 Difference]: Finished difference Result 220 states and 306 transitions. [2025-03-17 20:02:12,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 306 transitions. [2025-03-17 20:02:12,520 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2025-03-17 20:02:12,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 219 states and 305 transitions. [2025-03-17 20:02:12,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2025-03-17 20:02:12,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-03-17 20:02:12,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 305 transitions. [2025-03-17 20:02:12,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:12,521 INFO L218 hiAutomatonCegarLoop]: Abstraction has 219 states and 305 transitions. [2025-03-17 20:02:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 305 transitions. [2025-03-17 20:02:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 190. [2025-03-17 20:02:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 190 states have (on average 1.394736842105263) internal successors, (265), 189 states have internal predecessors, (265), 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) [2025-03-17 20:02:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 265 transitions. [2025-03-17 20:02:12,524 INFO L240 hiAutomatonCegarLoop]: Abstraction has 190 states and 265 transitions. [2025-03-17 20:02:12,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 20:02:12,525 INFO L432 stractBuchiCegarLoop]: Abstraction has 190 states and 265 transitions. [2025-03-17 20:02:12,525 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-17 20:02:12,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190 states and 265 transitions. [2025-03-17 20:02:12,526 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2025-03-17 20:02:12,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:12,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:12,527 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:12,527 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1] [2025-03-17 20:02:12,527 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-03-17 20:02:12,527 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-03-17 20:02:12,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:12,528 INFO L85 PathProgramCache]: Analyzing trace with hash 491344998, now seen corresponding path program 9 times [2025-03-17 20:02:12,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:12,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583552913] [2025-03-17 20:02:12,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:12,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 5 equivalence classes. [2025-03-17 20:02:12,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:02:12,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 20:02:12,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:12,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:12,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:02:12,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:02:12,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:12,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:12,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:12,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:12,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1363518906, now seen corresponding path program 8 times [2025-03-17 20:02:12,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:12,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250225678] [2025-03-17 20:02:12,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:12,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:12,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 20:02:12,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:12,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:12,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:12,564 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:12,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:02:12,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:12,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:12,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:12,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:12,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:12,567 INFO L85 PathProgramCache]: Analyzing trace with hash -315964223, now seen corresponding path program 10 times [2025-03-17 20:02:12,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:12,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248282185] [2025-03-17 20:02:12,567 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:12,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:12,574 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-17 20:02:12,587 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:02:12,588 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:12,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:12,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:12,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 20:02:12,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:02:12,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:12,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:12,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:14,328 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:14,328 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:14,328 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:14,328 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:14,328 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:14,328 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:14,328 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:14,328 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:14,328 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration19_Lasso [2025-03-17 20:02:14,328 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:14,328 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:14,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:14,822 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:14,822 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:14,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:14,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:14,824 INFO L229 MonitoredProcess]: Starting monitored process 110 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) [2025-03-17 20:02:14,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-03-17 20:02:14,825 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 [2025-03-17 20:02:14,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:14,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:14,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:14,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:14,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:14,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:14,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:14,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:14,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-03-17 20:02:14,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:14,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:14,843 INFO L229 MonitoredProcess]: Starting monitored process 111 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) [2025-03-17 20:02:14,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-03-17 20:02:14,844 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 [2025-03-17 20:02:14,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:14,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:14,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:14,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:14,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:14,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:14,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:14,855 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:14,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-03-17 20:02:14,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:14,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:14,862 INFO L229 MonitoredProcess]: Starting monitored process 112 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) [2025-03-17 20:02:14,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-03-17 20:02:14,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 [2025-03-17 20:02:14,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:14,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:14,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:14,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:14,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:14,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:14,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:14,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:14,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-03-17 20:02:14,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:14,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:14,880 INFO L229 MonitoredProcess]: Starting monitored process 113 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) [2025-03-17 20:02:14,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-03-17 20:02:14,882 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 [2025-03-17 20:02:14,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:14,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:14,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:14,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:14,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:14,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:14,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:14,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:14,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-03-17 20:02:14,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:14,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:14,899 INFO L229 MonitoredProcess]: Starting monitored process 114 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) [2025-03-17 20:02:14,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-03-17 20:02:14,901 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 [2025-03-17 20:02:14,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:14,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:14,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:14,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:14,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:14,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:14,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:14,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:14,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:14,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:14,920 INFO L229 MonitoredProcess]: Starting monitored process 115 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) [2025-03-17 20:02:14,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-03-17 20:02:14,921 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 [2025-03-17 20:02:14,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:14,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:14,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:14,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:14,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:14,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:14,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:14,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:14,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:14,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:14,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:14,938 INFO L229 MonitoredProcess]: Starting monitored process 116 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) [2025-03-17 20:02:14,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-03-17 20:02:14,940 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 [2025-03-17 20:02:14,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:14,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:14,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:14,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:14,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:14,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:14,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:14,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:14,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-03-17 20:02:14,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:14,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:14,957 INFO L229 MonitoredProcess]: Starting monitored process 117 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) [2025-03-17 20:02:14,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-03-17 20:02:14,958 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 [2025-03-17 20:02:14,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:14,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:14,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:14,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:14,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:14,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:14,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:14,969 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:14,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:14,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:14,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:14,976 INFO L229 MonitoredProcess]: Starting monitored process 118 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) [2025-03-17 20:02:14,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-03-17 20:02:14,977 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 [2025-03-17 20:02:14,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:14,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:14,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:14,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:14,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:14,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:14,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:14,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:14,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-03-17 20:02:14,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:14,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:14,995 INFO L229 MonitoredProcess]: Starting monitored process 119 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) [2025-03-17 20:02:14,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-03-17 20:02:14,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:15,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:15,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:15,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:15,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:15,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:15,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:15,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:15,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:15,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-03-17 20:02:15,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:15,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:15,014 INFO L229 MonitoredProcess]: Starting monitored process 120 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) [2025-03-17 20:02:15,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-03-17 20:02:15,015 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 [2025-03-17 20:02:15,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:15,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:15,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:15,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:15,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:15,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:15,030 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:15,040 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-17 20:02:15,040 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 20:02:15,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:15,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:15,042 INFO L229 MonitoredProcess]: Starting monitored process 121 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) [2025-03-17 20:02:15,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-03-17 20:02:15,043 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:15,053 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:15,053 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:15,053 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0#1) = -2*ULTIMATE.start_sort_~pass~0#1 + 5 Supporting invariants [] [2025-03-17 20:02:15,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-03-17 20:02:15,076 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2025-03-17 20:02:15,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:15,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:02:15,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-03-17 20:02:15,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:02:15,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:15,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:15,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 20:02:15,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:15,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:02:15,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:15,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:15,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:15,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 20:02:15,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:15,297 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 5 loop predicates [2025-03-17 20:02:15,297 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 190 states and 265 transitions. cyclomatic complexity: 86 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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) [2025-03-17 20:02:15,421 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 190 states and 265 transitions. cyclomatic complexity: 86. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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 559 states and 810 transitions. Complement of second has 21 states. [2025-03-17 20:02:15,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 8 stem states 5 non-accepting loop states 2 accepting loop states [2025-03-17 20:02:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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) [2025-03-17 20:02:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2025-03-17 20:02:15,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 44 transitions. Stem has 23 letters. Loop has 11 letters. [2025-03-17 20:02:15,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:15,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 44 transitions. Stem has 34 letters. Loop has 11 letters. [2025-03-17 20:02:15,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:15,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 44 transitions. Stem has 23 letters. Loop has 22 letters. [2025-03-17 20:02:15,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:15,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 559 states and 810 transitions. [2025-03-17 20:02:15,425 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 41 [2025-03-17 20:02:15,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 559 states to 529 states and 748 transitions. [2025-03-17 20:02:15,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2025-03-17 20:02:15,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2025-03-17 20:02:15,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 529 states and 748 transitions. [2025-03-17 20:02:15,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:15,428 INFO L218 hiAutomatonCegarLoop]: Abstraction has 529 states and 748 transitions. [2025-03-17 20:02:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states and 748 transitions. [2025-03-17 20:02:15,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 424. [2025-03-17 20:02:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 424 states have (on average 1.4103773584905661) internal successors, (598), 423 states have internal predecessors, (598), 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) [2025-03-17 20:02:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 598 transitions. [2025-03-17 20:02:15,434 INFO L240 hiAutomatonCegarLoop]: Abstraction has 424 states and 598 transitions. [2025-03-17 20:02:15,434 INFO L432 stractBuchiCegarLoop]: Abstraction has 424 states and 598 transitions. [2025-03-17 20:02:15,434 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-17 20:02:15,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 424 states and 598 transitions. [2025-03-17 20:02:15,435 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 35 [2025-03-17 20:02:15,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:15,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:15,436 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2025-03-17 20:02:15,436 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2025-03-17 20:02:15,436 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:15,436 INFO L754 eck$LassoCheckResult]: Loop: "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:15,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:15,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1006830782, now seen corresponding path program 11 times [2025-03-17 20:02:15,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:15,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060921660] [2025-03-17 20:02:15,436 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:15,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:15,441 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 5 equivalence classes. [2025-03-17 20:02:15,449 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 20:02:15,449 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 20:02:15,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:15,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:15,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 20:02:15,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 20:02:15,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:15,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:15,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:15,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2067907910, now seen corresponding path program 9 times [2025-03-17 20:02:15,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:15,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190607115] [2025-03-17 20:02:15,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:15,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:15,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 3 equivalence classes. [2025-03-17 20:02:15,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:02:15,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 20:02:15,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:15,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:15,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:02:15,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:02:15,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:15,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:15,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:15,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:15,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1098116999, now seen corresponding path program 12 times [2025-03-17 20:02:15,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:15,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797456856] [2025-03-17 20:02:15,467 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:02:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:15,472 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 7 equivalence classes. [2025-03-17 20:02:15,481 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 26 of 32 statements. [2025-03-17 20:02:15,481 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-17 20:02:15,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 44 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 20:02:15,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:15,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797456856] [2025-03-17 20:02:15,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797456856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:15,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794803492] [2025-03-17 20:02:15,583 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:02:15,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:15,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:15,585 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:15,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2025-03-17 20:02:15,643 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 7 equivalence classes. [2025-03-17 20:02:15,657 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 26 of 32 statements. [2025-03-17 20:02:15,657 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-17 20:02:15,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:15,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 20:02:15,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 20:02:15,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 28 proven. 34 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 20:02:15,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794803492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:15,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:15,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-03-17 20:02:15,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136696175] [2025-03-17 20:02:15,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:15,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:15,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 20:02:15,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-17 20:02:15,908 INFO L87 Difference]: Start difference. First operand 424 states and 598 transitions. cyclomatic complexity: 198 Second operand has 19 states, 18 states have (on average 2.5) internal successors, (45), 19 states have internal predecessors, (45), 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) [2025-03-17 20:02:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:15,966 INFO L93 Difference]: Finished difference Result 424 states and 597 transitions. [2025-03-17 20:02:15,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 424 states and 597 transitions. [2025-03-17 20:02:15,968 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2025-03-17 20:02:15,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 424 states to 424 states and 597 transitions. [2025-03-17 20:02:15,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2025-03-17 20:02:15,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2025-03-17 20:02:15,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 424 states and 597 transitions. [2025-03-17 20:02:15,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:15,970 INFO L218 hiAutomatonCegarLoop]: Abstraction has 424 states and 597 transitions. [2025-03-17 20:02:15,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states and 597 transitions. [2025-03-17 20:02:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 420. [2025-03-17 20:02:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 420 states have (on average 1.411904761904762) internal successors, (593), 419 states have internal predecessors, (593), 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) [2025-03-17 20:02:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 593 transitions. [2025-03-17 20:02:15,977 INFO L240 hiAutomatonCegarLoop]: Abstraction has 420 states and 593 transitions. [2025-03-17 20:02:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 20:02:15,978 INFO L432 stractBuchiCegarLoop]: Abstraction has 420 states and 593 transitions. [2025-03-17 20:02:15,978 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-17 20:02:15,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 420 states and 593 transitions. [2025-03-17 20:02:15,979 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2025-03-17 20:02:15,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:15,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:15,980 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2025-03-17 20:02:15,980 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:02:15,980 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" [2025-03-17 20:02:15,981 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" [2025-03-17 20:02:15,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:15,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1556499066, now seen corresponding path program 13 times [2025-03-17 20:02:15,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:15,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937098719] [2025-03-17 20:02:15,982 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:02:15,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:15,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:02:15,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:02:15,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:15,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:15,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:15,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:02:16,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:02:16,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:16,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:16,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:16,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash 36230794, now seen corresponding path program 10 times [2025-03-17 20:02:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:16,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917470399] [2025-03-17 20:02:16,008 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:16,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:16,010 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-03-17 20:02:16,011 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:16,011 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:16,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:16,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:16,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:16,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:16,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:16,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:16,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:16,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:16,014 INFO L85 PathProgramCache]: Analyzing trace with hash 984402981, now seen corresponding path program 14 times [2025-03-17 20:02:16,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:16,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303448392] [2025-03-17 20:02:16,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:16,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:16,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-17 20:02:16,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 20:02:16,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:16,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:16,028 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:16,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 20:02:16,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 20:02:16,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:16,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:16,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:16,681 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:16,681 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:16,681 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:16,681 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:16,681 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:16,681 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:16,681 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:16,681 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:16,681 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration21_Lasso [2025-03-17 20:02:16,681 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:16,681 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:16,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:16,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:17,016 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:17,016 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:17,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,018 INFO L229 MonitoredProcess]: Starting monitored process 123 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) [2025-03-17 20:02:17,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-03-17 20:02:17,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:17,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:17,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:17,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:17,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-03-17 20:02:17,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,038 INFO L229 MonitoredProcess]: Starting monitored process 124 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) [2025-03-17 20:02:17,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-03-17 20:02:17,039 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 [2025-03-17 20:02:17,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:17,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:17,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2025-03-17 20:02:17,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,059 INFO L229 MonitoredProcess]: Starting monitored process 125 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) [2025-03-17 20:02:17,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-03-17 20:02:17,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:17,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:17,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:17,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:17,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:17,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,078 INFO L229 MonitoredProcess]: Starting monitored process 126 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) [2025-03-17 20:02:17,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-03-17 20:02:17,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:17,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:17,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:17,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:17,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-03-17 20:02:17,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,098 INFO L229 MonitoredProcess]: Starting monitored process 127 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) [2025-03-17 20:02:17,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-03-17 20:02:17,100 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 [2025-03-17 20:02:17,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:17,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:17,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:17,111 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2025-03-17 20:02:17,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,118 INFO L229 MonitoredProcess]: Starting monitored process 128 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) [2025-03-17 20:02:17,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-03-17 20:02:17,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 [2025-03-17 20:02:17,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:17,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:17,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:17,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2025-03-17 20:02:17,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,138 INFO L229 MonitoredProcess]: Starting monitored process 129 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) [2025-03-17 20:02:17,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-03-17 20:02:17,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 [2025-03-17 20:02:17,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:17,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:17,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:17,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-03-17 20:02:17,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,157 INFO L229 MonitoredProcess]: Starting monitored process 130 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) [2025-03-17 20:02:17,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-03-17 20:02:17,158 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 [2025-03-17 20:02:17,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:17,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:17,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:17,169 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-03-17 20:02:17,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,176 INFO L229 MonitoredProcess]: Starting monitored process 131 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) [2025-03-17 20:02:17,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-03-17 20:02:17,178 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 [2025-03-17 20:02:17,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:17,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:17,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:17,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-03-17 20:02:17,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,195 INFO L229 MonitoredProcess]: Starting monitored process 132 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) [2025-03-17 20:02:17,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-03-17 20:02:17,197 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 [2025-03-17 20:02:17,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:17,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:17,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:17,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2025-03-17 20:02:17,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,214 INFO L229 MonitoredProcess]: Starting monitored process 133 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) [2025-03-17 20:02:17,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-03-17 20:02:17,215 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 [2025-03-17 20:02:17,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:17,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:17,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2025-03-17 20:02:17,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,234 INFO L229 MonitoredProcess]: Starting monitored process 134 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) [2025-03-17 20:02:17,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-03-17 20:02:17,235 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 [2025-03-17 20:02:17,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:17,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:17,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:17,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:17,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,254 INFO L229 MonitoredProcess]: Starting monitored process 135 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) [2025-03-17 20:02:17,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-03-17 20:02:17,255 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 [2025-03-17 20:02:17,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:17,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:17,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:17,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2025-03-17 20:02:17,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,273 INFO L229 MonitoredProcess]: Starting monitored process 136 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) [2025-03-17 20:02:17,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-03-17 20:02:17,275 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 [2025-03-17 20:02:17,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:17,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:17,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:17,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:17,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,292 INFO L229 MonitoredProcess]: Starting monitored process 137 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) [2025-03-17 20:02:17,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-03-17 20:02:17,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 [2025-03-17 20:02:17,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:17,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:17,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:17,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2025-03-17 20:02:17,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,312 INFO L229 MonitoredProcess]: Starting monitored process 138 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) [2025-03-17 20:02:17,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-03-17 20:02:17,313 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 [2025-03-17 20:02:17,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:17,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:17,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2025-03-17 20:02:17,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,334 INFO L229 MonitoredProcess]: Starting monitored process 139 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) [2025-03-17 20:02:17,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2025-03-17 20:02:17,336 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 [2025-03-17 20:02:17,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:17,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:17,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:17,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,357 INFO L229 MonitoredProcess]: Starting monitored process 140 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) [2025-03-17 20:02:17,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-03-17 20:02:17,358 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 [2025-03-17 20:02:17,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:17,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:17,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:17,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2025-03-17 20:02:17,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,378 INFO L229 MonitoredProcess]: Starting monitored process 141 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) [2025-03-17 20:02:17,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-03-17 20:02:17,379 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 [2025-03-17 20:02:17,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:17,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:17,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:17,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:17,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:17,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:17,400 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:17,411 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-17 20:02:17,411 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2025-03-17 20:02:17,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:17,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:17,413 INFO L229 MonitoredProcess]: Starting monitored process 142 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) [2025-03-17 20:02:17,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-03-17 20:02:17,415 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:17,424 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:17,424 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:17,424 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1) = 1*ULTIMATE.start_sort_~i~0#1 Supporting invariants [] [2025-03-17 20:02:17,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2025-03-17 20:02:17,435 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-17 20:02:17,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:17,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:02:17,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:02:17,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:17,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:17,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:17,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:17,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:17,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:17,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:17,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:17,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:02:17,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:17,501 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 20:02:17,501 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 420 states and 593 transitions. cyclomatic complexity: 197 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-17 20:02:17,516 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 420 states and 593 transitions. cyclomatic complexity: 197. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 475 states and 656 transitions. Complement of second has 7 states. [2025-03-17 20:02:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-17 20:02:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-03-17 20:02:17,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 23 letters. Loop has 5 letters. [2025-03-17 20:02:17,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:17,518 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:17,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:17,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:02:17,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:02:17,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:17,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:17,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:17,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:17,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:17,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:17,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:17,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:17,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:02:17,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:17,586 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 20:02:17,586 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 420 states and 593 transitions. cyclomatic complexity: 197 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-17 20:02:17,598 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 420 states and 593 transitions. cyclomatic complexity: 197. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 475 states and 656 transitions. Complement of second has 7 states. [2025-03-17 20:02:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-17 20:02:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-03-17 20:02:17,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 23 letters. Loop has 5 letters. [2025-03-17 20:02:17,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:17,599 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:17,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:17,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:02:17,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:02:17,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:17,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:17,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:17,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:17,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:17,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:17,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:17,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:17,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:02:17,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:17,661 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 3 loop predicates [2025-03-17 20:02:17,661 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 420 states and 593 transitions. cyclomatic complexity: 197 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-17 20:02:17,680 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 420 states and 593 transitions. cyclomatic complexity: 197. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 985 states and 1428 transitions. Complement of second has 11 states. [2025-03-17 20:02:17,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-17 20:02:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2025-03-17 20:02:17,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 23 letters. Loop has 5 letters. [2025-03-17 20:02:17,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:17,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 28 letters. Loop has 5 letters. [2025-03-17 20:02:17,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:17,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 23 letters. Loop has 10 letters. [2025-03-17 20:02:17,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:17,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 985 states and 1428 transitions. [2025-03-17 20:02:17,686 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2025-03-17 20:02:17,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 985 states to 594 states and 831 transitions. [2025-03-17 20:02:17,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2025-03-17 20:02:17,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-03-17 20:02:17,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 594 states and 831 transitions. [2025-03-17 20:02:17,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:17,688 INFO L218 hiAutomatonCegarLoop]: Abstraction has 594 states and 831 transitions. [2025-03-17 20:02:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states and 831 transitions. [2025-03-17 20:02:17,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 309. [2025-03-17 20:02:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 309 states have (on average 1.3948220064724919) internal successors, (431), 308 states have internal predecessors, (431), 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) [2025-03-17 20:02:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 431 transitions. [2025-03-17 20:02:17,693 INFO L240 hiAutomatonCegarLoop]: Abstraction has 309 states and 431 transitions. [2025-03-17 20:02:17,694 INFO L432 stractBuchiCegarLoop]: Abstraction has 309 states and 431 transitions. [2025-03-17 20:02:17,694 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-17 20:02:17,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 309 states and 431 transitions. [2025-03-17 20:02:17,694 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2025-03-17 20:02:17,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:17,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:17,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 4, 3, 1, 1, 1, 1, 1] [2025-03-17 20:02:17,695 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1] [2025-03-17 20:02:17,695 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" [2025-03-17 20:02:17,695 INFO L754 eck$LassoCheckResult]: Loop: "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" [2025-03-17 20:02:17,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:17,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1162109818, now seen corresponding path program 2 times [2025-03-17 20:02:17,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:17,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482556926] [2025-03-17 20:02:17,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:17,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:17,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-17 20:02:17,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:02:17,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:17,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:17,709 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:17,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 20:02:17,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:02:17,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:17,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:17,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:17,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1308095000, now seen corresponding path program 11 times [2025-03-17 20:02:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:17,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009187212] [2025-03-17 20:02:17,719 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:17,721 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 11 statements into 3 equivalence classes. [2025-03-17 20:02:17,722 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:17,723 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 20:02:17,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:17,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:17,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:02:17,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:17,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:17,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:17,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:17,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:17,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1875970865, now seen corresponding path program 15 times [2025-03-17 20:02:17,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:17,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592238179] [2025-03-17 20:02:17,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:17,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:17,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 6 equivalence classes. [2025-03-17 20:02:17,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2025-03-17 20:02:17,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:02:17,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 20:02:17,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 46 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 20:02:18,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:18,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592238179] [2025-03-17 20:02:18,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592238179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:18,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926613064] [2025-03-17 20:02:18,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:18,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:18,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:18,027 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:18,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2025-03-17 20:02:18,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 6 equivalence classes. [2025-03-17 20:02:18,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:02:18,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 20:02:18,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:18,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 20:02:18,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 20:02:18,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 20:02:18,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926613064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:18,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:18,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2025-03-17 20:02:18,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479654139] [2025-03-17 20:02:18,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:18,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:18,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 20:02:18,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2025-03-17 20:02:18,553 INFO L87 Difference]: Start difference. First operand 309 states and 431 transitions. cyclomatic complexity: 141 Second operand has 30 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 30 states have internal predecessors, (56), 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) [2025-03-17 20:02:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:18,756 INFO L93 Difference]: Finished difference Result 401 states and 552 transitions. [2025-03-17 20:02:18,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 552 transitions. [2025-03-17 20:02:18,757 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2025-03-17 20:02:18,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 386 states and 534 transitions. [2025-03-17 20:02:18,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2025-03-17 20:02:18,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2025-03-17 20:02:18,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 534 transitions. [2025-03-17 20:02:18,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:18,759 INFO L218 hiAutomatonCegarLoop]: Abstraction has 386 states and 534 transitions. [2025-03-17 20:02:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 534 transitions. [2025-03-17 20:02:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 324. [2025-03-17 20:02:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 324 states have (on average 1.3858024691358024) internal successors, (449), 323 states have internal predecessors, (449), 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) [2025-03-17 20:02:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 449 transitions. [2025-03-17 20:02:18,764 INFO L240 hiAutomatonCegarLoop]: Abstraction has 324 states and 449 transitions. [2025-03-17 20:02:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 20:02:18,765 INFO L432 stractBuchiCegarLoop]: Abstraction has 324 states and 449 transitions. [2025-03-17 20:02:18,765 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-17 20:02:18,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 324 states and 449 transitions. [2025-03-17 20:02:18,766 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2025-03-17 20:02:18,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:18,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:18,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:18,766 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:02:18,766 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:18,767 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:18,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:18,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1533092164, now seen corresponding path program 3 times [2025-03-17 20:02:18,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:18,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374920590] [2025-03-17 20:02:18,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:18,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:18,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 6 equivalence classes. [2025-03-17 20:02:18,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:18,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 20:02:18,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:18,797 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:18,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:02:18,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:18,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:18,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:18,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:18,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash 35720, now seen corresponding path program 4 times [2025-03-17 20:02:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:18,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089834888] [2025-03-17 20:02:18,808 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:18,811 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-17 20:02:18,811 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:18,812 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:18,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:18,812 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:18,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:18,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:18,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:18,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:18,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:18,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:18,814 INFO L85 PathProgramCache]: Analyzing trace with hash -333562011, now seen corresponding path program 4 times [2025-03-17 20:02:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:18,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692477398] [2025-03-17 20:02:18,814 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:18,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:18,819 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-17 20:02:18,832 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 20:02:18,833 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:18,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:18,833 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:18,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 20:02:18,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 20:02:18,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:18,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:18,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:20,486 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:20,486 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:20,486 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:20,486 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:20,486 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:20,486 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:20,486 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:20,486 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:20,486 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration23_Lasso [2025-03-17 20:02:20,486 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:20,486 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:20,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:20,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:21,096 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:21,096 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:21,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:21,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:21,098 INFO L229 MonitoredProcess]: Starting monitored process 144 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) [2025-03-17 20:02:21,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-03-17 20:02:21,100 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 [2025-03-17 20:02:21,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:21,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:21,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:21,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:21,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:21,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:21,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:21,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:21,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-03-17 20:02:21,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:21,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:21,118 INFO L229 MonitoredProcess]: Starting monitored process 145 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) [2025-03-17 20:02:21,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-03-17 20:02:21,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 [2025-03-17 20:02:21,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:21,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:21,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:21,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:21,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:21,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:21,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:21,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:21,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2025-03-17 20:02:21,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:21,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:21,138 INFO L229 MonitoredProcess]: Starting monitored process 146 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) [2025-03-17 20:02:21,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-03-17 20:02:21,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 [2025-03-17 20:02:21,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:21,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:21,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:21,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:21,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:21,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:21,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:21,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:21,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2025-03-17 20:02:21,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:21,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:21,157 INFO L229 MonitoredProcess]: Starting monitored process 147 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) [2025-03-17 20:02:21,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-03-17 20:02:21,158 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 [2025-03-17 20:02:21,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:21,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:21,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:21,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:21,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:21,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:21,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:21,169 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:21,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2025-03-17 20:02:21,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:21,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:21,176 INFO L229 MonitoredProcess]: Starting monitored process 148 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) [2025-03-17 20:02:21,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-03-17 20:02:21,178 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 [2025-03-17 20:02:21,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:21,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:21,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:21,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:21,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:21,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:21,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:21,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:21,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:21,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:21,197 INFO L229 MonitoredProcess]: Starting monitored process 149 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) [2025-03-17 20:02:21,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-03-17 20:02:21,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:21,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:21,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:21,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:21,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:21,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:21,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:21,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:21,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:21,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-03-17 20:02:21,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:21,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:21,216 INFO L229 MonitoredProcess]: Starting monitored process 150 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) [2025-03-17 20:02:21,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-03-17 20:02:21,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:21,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:21,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:21,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:21,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:21,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:21,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:21,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:21,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:21,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:21,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:21,237 INFO L229 MonitoredProcess]: Starting monitored process 151 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) [2025-03-17 20:02:21,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-03-17 20:02:21,239 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 [2025-03-17 20:02:21,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:21,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:21,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:21,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:21,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:21,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:21,257 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:21,267 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 20:02:21,267 INFO L444 ModelExtractionUtils]: 8 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 20:02:21,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:21,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:21,269 INFO L229 MonitoredProcess]: Starting monitored process 152 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) [2025-03-17 20:02:21,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-03-17 20:02:21,270 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:21,280 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:21,280 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:21,280 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0#1, ULTIMATE.start_sort_~i~0#1) = -2*ULTIMATE.start_sort_~pass~0#1 - 2*ULTIMATE.start_sort_~i~0#1 + 7 Supporting invariants [] [2025-03-17 20:02:21,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2025-03-17 20:02:21,301 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-17 20:02:21,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:21,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:02:21,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:21,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:21,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:21,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 20:02:21,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:21,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:21,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:21,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:21,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:21,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:02:21,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:21,449 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-17 20:02:21,449 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 324 states and 449 transitions. cyclomatic complexity: 144 Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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) [2025-03-17 20:02:21,515 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 324 states and 449 transitions. cyclomatic complexity: 144. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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 385 states and 525 transitions. Complement of second has 15 states. [2025-03-17 20:02:21,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 20:02:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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) [2025-03-17 20:02:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2025-03-17 20:02:21,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 21 transitions. Stem has 25 letters. Loop has 3 letters. [2025-03-17 20:02:21,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:21,516 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:21,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:21,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:02:21,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:21,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:21,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:21,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 20:02:21,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:21,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:21,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:21,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:21,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:21,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:02:21,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:21,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:21,669 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-17 20:02:21,669 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 324 states and 449 transitions. cyclomatic complexity: 144 Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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) [2025-03-17 20:02:21,735 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 324 states and 449 transitions. cyclomatic complexity: 144. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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 385 states and 525 transitions. Complement of second has 15 states. [2025-03-17 20:02:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 20:02:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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) [2025-03-17 20:02:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2025-03-17 20:02:21,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 21 transitions. Stem has 25 letters. Loop has 3 letters. [2025-03-17 20:02:21,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:21,739 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:21,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:21,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:02:21,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:21,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:21,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:21,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 20:02:21,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:21,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:21,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:21,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:21,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:21,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:02:21,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:21,910 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-17 20:02:21,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 324 states and 449 transitions. cyclomatic complexity: 144 Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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) [2025-03-17 20:02:21,987 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 324 states and 449 transitions. cyclomatic complexity: 144. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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 456 states and 636 transitions. Complement of second has 14 states. [2025-03-17 20:02:21,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 20:02:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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) [2025-03-17 20:02:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2025-03-17 20:02:21,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 31 transitions. Stem has 25 letters. Loop has 3 letters. [2025-03-17 20:02:21,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:21,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 31 transitions. Stem has 28 letters. Loop has 3 letters. [2025-03-17 20:02:21,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:21,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 31 transitions. Stem has 25 letters. Loop has 6 letters. [2025-03-17 20:02:21,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:21,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 456 states and 636 transitions. [2025-03-17 20:02:21,990 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2025-03-17 20:02:21,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 456 states to 192 states and 254 transitions. [2025-03-17 20:02:21,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-03-17 20:02:21,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-03-17 20:02:21,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 254 transitions. [2025-03-17 20:02:21,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:21,991 INFO L218 hiAutomatonCegarLoop]: Abstraction has 192 states and 254 transitions. [2025-03-17 20:02:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 254 transitions. [2025-03-17 20:02:21,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2025-03-17 20:02:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 189 states have (on average 1.3280423280423281) internal successors, (251), 188 states have internal predecessors, (251), 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) [2025-03-17 20:02:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 251 transitions. [2025-03-17 20:02:21,993 INFO L240 hiAutomatonCegarLoop]: Abstraction has 189 states and 251 transitions. [2025-03-17 20:02:21,993 INFO L432 stractBuchiCegarLoop]: Abstraction has 189 states and 251 transitions. [2025-03-17 20:02:21,993 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-17 20:02:21,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 189 states and 251 transitions. [2025-03-17 20:02:21,993 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-17 20:02:21,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:21,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:21,994 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 2, 1, 1, 1, 1, 1] [2025-03-17 20:02:21,994 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2025-03-17 20:02:21,994 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:21,994 INFO L754 eck$LassoCheckResult]: Loop: "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:21,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:21,994 INFO L85 PathProgramCache]: Analyzing trace with hash -263859195, now seen corresponding path program 16 times [2025-03-17 20:02:21,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:21,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47236134] [2025-03-17 20:02:21,995 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:21,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:21,999 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-17 20:02:22,019 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:22,020 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:22,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:22,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:22,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:02:22,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:22,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:22,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:22,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2025-03-17 20:02:22,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:22,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2114481956, now seen corresponding path program 12 times [2025-03-17 20:02:22,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:22,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073992891] [2025-03-17 20:02:22,033 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:02:22,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:22,035 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 2 equivalence classes. [2025-03-17 20:02:22,036 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:02:22,036 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-17 20:02:22,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:22,037 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:22,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:02:22,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:02:22,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:22,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:22,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:22,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:22,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1513824480, now seen corresponding path program 17 times [2025-03-17 20:02:22,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:22,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408098909] [2025-03-17 20:02:22,040 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:22,050 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 8 equivalence classes. [2025-03-17 20:02:22,058 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 27 of 33 statements. [2025-03-17 20:02:22,058 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-17 20:02:22,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 23 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 20:02:22,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:22,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408098909] [2025-03-17 20:02:22,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408098909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:22,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227867981] [2025-03-17 20:02:22,130 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:22,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:22,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:22,136 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:22,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2025-03-17 20:02:22,208 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 8 equivalence classes. [2025-03-17 20:02:22,225 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 27 of 33 statements. [2025-03-17 20:02:22,226 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-17 20:02:22,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:22,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:22,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 23 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 20:02:22,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 23 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 20:02:22,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227867981] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:22,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:22,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 14 [2025-03-17 20:02:22,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430962666] [2025-03-17 20:02:22,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:22,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:22,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 20:02:22,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 20:02:22,442 INFO L87 Difference]: Start difference. First operand 189 states and 251 transitions. cyclomatic complexity: 73 Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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) [2025-03-17 20:02:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:22,568 INFO L93 Difference]: Finished difference Result 386 states and 509 transitions. [2025-03-17 20:02:22,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 509 transitions. [2025-03-17 20:02:22,569 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2025-03-17 20:02:22,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 361 states and 479 transitions. [2025-03-17 20:02:22,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2025-03-17 20:02:22,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2025-03-17 20:02:22,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 361 states and 479 transitions. [2025-03-17 20:02:22,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:22,570 INFO L218 hiAutomatonCegarLoop]: Abstraction has 361 states and 479 transitions. [2025-03-17 20:02:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states and 479 transitions. [2025-03-17 20:02:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 259. [2025-03-17 20:02:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 259 states have (on average 1.3204633204633205) internal successors, (342), 258 states have internal predecessors, (342), 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) [2025-03-17 20:02:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 342 transitions. [2025-03-17 20:02:22,574 INFO L240 hiAutomatonCegarLoop]: Abstraction has 259 states and 342 transitions. [2025-03-17 20:02:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 20:02:22,574 INFO L432 stractBuchiCegarLoop]: Abstraction has 259 states and 342 transitions. [2025-03-17 20:02:22,574 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-17 20:02:22,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 342 transitions. [2025-03-17 20:02:22,575 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2025-03-17 20:02:22,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:22,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:22,575 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1, 1, 1] [2025-03-17 20:02:22,575 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 1, 1] [2025-03-17 20:02:22,575 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" [2025-03-17 20:02:22,576 INFO L754 eck$LassoCheckResult]: Loop: "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" [2025-03-17 20:02:22,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:22,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1317779958, now seen corresponding path program 3 times [2025-03-17 20:02:22,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:22,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046465448] [2025-03-17 20:02:22,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:22,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:22,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 5 equivalence classes. [2025-03-17 20:02:22,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:22,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 20:02:22,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:22,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:22,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:02:22,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:22,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:22,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:22,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:22,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:22,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1219863332, now seen corresponding path program 13 times [2025-03-17 20:02:22,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:22,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844151652] [2025-03-17 20:02:22,601 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:02:22,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:22,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:02:22,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:02:22,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:22,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:22,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:22,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:02:22,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:02:22,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:22,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:22,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:22,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:22,609 INFO L85 PathProgramCache]: Analyzing trace with hash -175972571, now seen corresponding path program 18 times [2025-03-17 20:02:22,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:22,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129825050] [2025-03-17 20:02:22,609 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:02:22,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:22,614 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 7 equivalence classes. [2025-03-17 20:02:22,632 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 20:02:22,632 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-17 20:02:22,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:22,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:22,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 20:02:22,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 20:02:22,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:22,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:22,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:25,686 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:25,687 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:25,687 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:25,687 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:25,687 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:25,687 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:25,687 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:25,687 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:25,687 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration25_Lasso [2025-03-17 20:02:25,687 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:25,687 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:25,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:25,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:26,174 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:26,174 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:26,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:26,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:26,176 INFO L229 MonitoredProcess]: Starting monitored process 154 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) [2025-03-17 20:02:26,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-03-17 20:02:26,178 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 [2025-03-17 20:02:26,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:26,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:26,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:26,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:26,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:26,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:26,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:26,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2025-03-17 20:02:26,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:26,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:26,198 INFO L229 MonitoredProcess]: Starting monitored process 155 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) [2025-03-17 20:02:26,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-03-17 20:02:26,200 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 [2025-03-17 20:02:26,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:26,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:26,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:26,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:26,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:26,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:26,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:26,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2025-03-17 20:02:26,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:26,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:26,221 INFO L229 MonitoredProcess]: Starting monitored process 156 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) [2025-03-17 20:02:26,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-03-17 20:02:26,222 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 [2025-03-17 20:02:26,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:26,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:26,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:26,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:26,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:26,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:26,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:26,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:26,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:26,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:26,244 INFO L229 MonitoredProcess]: Starting monitored process 157 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) [2025-03-17 20:02:26,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-03-17 20:02:26,245 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 [2025-03-17 20:02:26,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:26,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:26,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:26,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:26,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:26,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:26,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:26,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2025-03-17 20:02:26,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:26,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:26,277 INFO L229 MonitoredProcess]: Starting monitored process 158 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) [2025-03-17 20:02:26,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-03-17 20:02:26,279 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 [2025-03-17 20:02:26,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:26,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:26,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:26,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:26,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:26,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:26,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:26,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2025-03-17 20:02:26,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:26,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:26,301 INFO L229 MonitoredProcess]: Starting monitored process 159 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) [2025-03-17 20:02:26,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-03-17 20:02:26,303 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 [2025-03-17 20:02:26,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:26,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:26,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:26,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:26,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:26,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:26,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:26,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:26,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:26,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:26,330 INFO L229 MonitoredProcess]: Starting monitored process 160 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) [2025-03-17 20:02:26,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-03-17 20:02:26,333 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 [2025-03-17 20:02:26,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:26,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:26,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:26,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:26,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:26,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:26,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:26,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:26,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:26,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:26,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:26,354 INFO L229 MonitoredProcess]: Starting monitored process 161 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) [2025-03-17 20:02:26,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2025-03-17 20:02:26,357 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 [2025-03-17 20:02:26,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:26,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:26,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:26,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:26,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:26,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:26,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:26,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:26,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:26,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:26,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:26,377 INFO L229 MonitoredProcess]: Starting monitored process 162 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) [2025-03-17 20:02:26,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-03-17 20:02:26,380 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 [2025-03-17 20:02:26,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:26,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:26,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:26,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:26,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:26,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:26,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:26,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:26,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:26,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:26,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:26,400 INFO L229 MonitoredProcess]: Starting monitored process 163 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) [2025-03-17 20:02:26,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-03-17 20:02:26,402 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 [2025-03-17 20:02:26,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:26,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:26,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:26,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:26,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:26,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:26,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:26,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:26,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:26,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:26,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:26,422 INFO L229 MonitoredProcess]: Starting monitored process 164 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) [2025-03-17 20:02:26,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-03-17 20:02:26,424 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 [2025-03-17 20:02:26,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:26,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:26,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:26,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:26,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:26,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:26,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:26,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:26,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:26,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:26,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:26,444 INFO L229 MonitoredProcess]: Starting monitored process 165 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) [2025-03-17 20:02:26,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2025-03-17 20:02:26,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:26,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:26,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:26,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:26,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:26,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:26,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:26,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:26,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:26,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:26,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:26,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:26,465 INFO L229 MonitoredProcess]: Starting monitored process 166 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) [2025-03-17 20:02:26,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-03-17 20:02:26,467 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 [2025-03-17 20:02:26,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:26,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:26,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:26,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:26,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:26,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:26,484 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:26,490 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-17 20:02:26,490 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-17 20:02:26,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:26,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:26,493 INFO L229 MonitoredProcess]: Starting monitored process 167 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) [2025-03-17 20:02:26,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-03-17 20:02:26,494 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:26,505 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:26,505 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:26,505 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1) = 1*ULTIMATE.start_sort_~i~0#1 Supporting invariants [] [2025-03-17 20:02:26,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2025-03-17 20:02:26,531 INFO L156 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2025-03-17 20:02:26,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:26,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:02:26,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:26,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:26,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:26,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:26,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:26,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:02:26,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:02:26,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:26,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:26,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:26,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:26,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2025-03-17 20:02:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:26,661 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2025-03-17 20:02:26,662 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 342 transitions. cyclomatic complexity: 94 Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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) [2025-03-17 20:02:26,686 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 342 transitions. cyclomatic complexity: 94. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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) Result 389 states and 525 transitions. Complement of second has 9 states. [2025-03-17 20:02:26,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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) [2025-03-17 20:02:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2025-03-17 20:02:26,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 25 letters. Loop has 14 letters. [2025-03-17 20:02:26,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:26,687 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:26,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:26,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:02:26,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:26,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:26,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:26,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:26,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:26,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:02:26,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:02:26,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:26,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:26,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:26,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:26,807 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 8 loop predicates [2025-03-17 20:02:26,807 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 342 transitions. cyclomatic complexity: 94 Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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) [2025-03-17 20:02:26,963 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 342 transitions. cyclomatic complexity: 94. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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) Result 454 states and 614 transitions. Complement of second has 23 states. [2025-03-17 20:02:26,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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) [2025-03-17 20:02:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2025-03-17 20:02:26,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 25 letters. Loop has 14 letters. [2025-03-17 20:02:26,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:26,964 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:26,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:26,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:02:26,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:26,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:26,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:26,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:26,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:27,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:02:27,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:02:27,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:27,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:27,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:27,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:27,095 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 8 loop predicates [2025-03-17 20:02:27,095 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 342 transitions. cyclomatic complexity: 94 Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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) [2025-03-17 20:02:27,117 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 342 transitions. cyclomatic complexity: 94. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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) Result 589 states and 769 transitions. Complement of second has 12 states. [2025-03-17 20:02:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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) [2025-03-17 20:02:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2025-03-17 20:02:27,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 25 letters. Loop has 14 letters. [2025-03-17 20:02:27,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:27,118 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:27,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:27,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:02:27,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:27,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:27,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:27,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:27,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:27,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:02:27,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:02:27,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:27,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:27,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:27,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:27,239 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 8 loop predicates [2025-03-17 20:02:27,239 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 342 transitions. cyclomatic complexity: 94 Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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) [2025-03-17 20:02:27,408 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 342 transitions. cyclomatic complexity: 94. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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) Result 1109 states and 1447 transitions. Complement of second has 55 states. [2025-03-17 20:02:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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) [2025-03-17 20:02:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2025-03-17 20:02:27,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 40 transitions. Stem has 25 letters. Loop has 14 letters. [2025-03-17 20:02:27,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:27,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 40 transitions. Stem has 39 letters. Loop has 14 letters. [2025-03-17 20:02:27,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:27,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 40 transitions. Stem has 25 letters. Loop has 28 letters. [2025-03-17 20:02:27,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:27,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1109 states and 1447 transitions. [2025-03-17 20:02:27,412 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 78 [2025-03-17 20:02:27,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1109 states to 846 states and 1131 transitions. [2025-03-17 20:02:27,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2025-03-17 20:02:27,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2025-03-17 20:02:27,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 846 states and 1131 transitions. [2025-03-17 20:02:27,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:27,414 INFO L218 hiAutomatonCegarLoop]: Abstraction has 846 states and 1131 transitions. [2025-03-17 20:02:27,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states and 1131 transitions. [2025-03-17 20:02:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 542. [2025-03-17 20:02:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 542 states have (on average 1.3874538745387455) internal successors, (752), 541 states have internal predecessors, (752), 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) [2025-03-17 20:02:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 752 transitions. [2025-03-17 20:02:27,421 INFO L240 hiAutomatonCegarLoop]: Abstraction has 542 states and 752 transitions. [2025-03-17 20:02:27,421 INFO L432 stractBuchiCegarLoop]: Abstraction has 542 states and 752 transitions. [2025-03-17 20:02:27,421 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-03-17 20:02:27,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 542 states and 752 transitions. [2025-03-17 20:02:27,423 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 66 [2025-03-17 20:02:27,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:27,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:27,423 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1, 1, 1] [2025-03-17 20:02:27,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 5, 1, 1] [2025-03-17 20:02:27,423 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" [2025-03-17 20:02:27,424 INFO L754 eck$LassoCheckResult]: Loop: "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" [2025-03-17 20:02:27,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1317779958, now seen corresponding path program 4 times [2025-03-17 20:02:27,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:27,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778921189] [2025-03-17 20:02:27,424 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:27,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:27,430 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-17 20:02:27,438 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:27,438 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:27,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:27,438 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:27,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 20:02:27,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:27,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:27,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:27,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:27,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:27,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1230227096, now seen corresponding path program 14 times [2025-03-17 20:02:27,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:27,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491834933] [2025-03-17 20:02:27,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:27,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:27,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 20:02:27,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:02:27,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:27,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:27,453 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:27,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:02:27,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:02:27,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:27,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:27,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:27,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1756210815, now seen corresponding path program 19 times [2025-03-17 20:02:27,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:27,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508974442] [2025-03-17 20:02:27,459 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:02:27,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:27,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 20:02:27,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 20:02:27,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:27,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 21 proven. 102 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 20:02:27,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:27,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508974442] [2025-03-17 20:02:27,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508974442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:27,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396585461] [2025-03-17 20:02:27,642 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:02:27,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:27,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:27,644 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:27,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Waiting until timeout for monitored process [2025-03-17 20:02:27,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 20:02:27,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 20:02:27,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:27,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:27,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 20:02:27,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 20:02:27,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 32 proven. 91 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 20:02:27,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396585461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:27,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:27,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 26 [2025-03-17 20:02:27,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468366880] [2025-03-17 20:02:27,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:28,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:28,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 20:02:28,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2025-03-17 20:02:28,180 INFO L87 Difference]: Start difference. First operand 542 states and 752 transitions. cyclomatic complexity: 231 Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 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) [2025-03-17 20:02:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:28,336 INFO L93 Difference]: Finished difference Result 1106 states and 1517 transitions. [2025-03-17 20:02:28,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1106 states and 1517 transitions. [2025-03-17 20:02:28,338 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 88 [2025-03-17 20:02:28,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1106 states to 626 states and 843 transitions. [2025-03-17 20:02:28,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2025-03-17 20:02:28,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2025-03-17 20:02:28,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 843 transitions. [2025-03-17 20:02:28,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:28,341 INFO L218 hiAutomatonCegarLoop]: Abstraction has 626 states and 843 transitions. [2025-03-17 20:02:28,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 843 transitions. [2025-03-17 20:02:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 608. [2025-03-17 20:02:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 608 states have (on average 1.356907894736842) internal successors, (825), 607 states have internal predecessors, (825), 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) [2025-03-17 20:02:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 825 transitions. [2025-03-17 20:02:28,346 INFO L240 hiAutomatonCegarLoop]: Abstraction has 608 states and 825 transitions. [2025-03-17 20:02:28,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 20:02:28,347 INFO L432 stractBuchiCegarLoop]: Abstraction has 608 states and 825 transitions. [2025-03-17 20:02:28,347 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-03-17 20:02:28,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 608 states and 825 transitions. [2025-03-17 20:02:28,348 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 82 [2025-03-17 20:02:28,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:28,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:28,348 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 1, 1, 1, 1, 1] [2025-03-17 20:02:28,348 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 5, 1, 1] [2025-03-17 20:02:28,349 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" [2025-03-17 20:02:28,349 INFO L754 eck$LassoCheckResult]: Loop: "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" [2025-03-17 20:02:28,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:28,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1044569725, now seen corresponding path program 5 times [2025-03-17 20:02:28,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:28,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912139880] [2025-03-17 20:02:28,349 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:28,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:28,354 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 5 equivalence classes. [2025-03-17 20:02:28,362 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 20:02:28,362 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 20:02:28,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:28,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:28,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 20:02:28,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 20:02:28,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:28,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:28,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:28,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:28,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1230227096, now seen corresponding path program 15 times [2025-03-17 20:02:28,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:28,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872574015] [2025-03-17 20:02:28,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:28,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:28,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 5 equivalence classes. [2025-03-17 20:02:28,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:02:28,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 20:02:28,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:28,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:28,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:02:28,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:02:28,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:28,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:28,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:28,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:28,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1030398572, now seen corresponding path program 20 times [2025-03-17 20:02:28,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:28,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289372595] [2025-03-17 20:02:28,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:28,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:28,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-17 20:02:28,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 20:02:28,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:28,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 91 proven. 48 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 20:02:28,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:28,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289372595] [2025-03-17 20:02:28,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289372595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:28,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627024191] [2025-03-17 20:02:28,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:28,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:28,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:28,733 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:28,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Waiting until timeout for monitored process [2025-03-17 20:02:28,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-17 20:02:28,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 20:02:28,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:28,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:28,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 20:02:28,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 97 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 20:02:29,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 97 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 20:02:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627024191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:29,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:29,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 40 [2025-03-17 20:02:29,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525090234] [2025-03-17 20:02:29,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:29,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:29,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 20:02:29,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 20:02:29,493 INFO L87 Difference]: Start difference. First operand 608 states and 825 transitions. cyclomatic complexity: 240 Second operand has 40 states, 40 states have (on average 1.925) internal successors, (77), 40 states have internal predecessors, (77), 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) [2025-03-17 20:02:29,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:29,762 INFO L93 Difference]: Finished difference Result 715 states and 970 transitions. [2025-03-17 20:02:29,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 715 states and 970 transitions. [2025-03-17 20:02:29,764 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 82 [2025-03-17 20:02:29,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 715 states to 693 states and 946 transitions. [2025-03-17 20:02:29,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2025-03-17 20:02:29,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2025-03-17 20:02:29,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 693 states and 946 transitions. [2025-03-17 20:02:29,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:29,767 INFO L218 hiAutomatonCegarLoop]: Abstraction has 693 states and 946 transitions. [2025-03-17 20:02:29,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states and 946 transitions. [2025-03-17 20:02:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 623. [2025-03-17 20:02:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 623 states have (on average 1.3531300160513644) internal successors, (843), 622 states have internal predecessors, (843), 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) [2025-03-17 20:02:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 843 transitions. [2025-03-17 20:02:29,774 INFO L240 hiAutomatonCegarLoop]: Abstraction has 623 states and 843 transitions. [2025-03-17 20:02:29,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 20:02:29,775 INFO L432 stractBuchiCegarLoop]: Abstraction has 623 states and 843 transitions. [2025-03-17 20:02:29,775 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-03-17 20:02:29,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 623 states and 843 transitions. [2025-03-17 20:02:29,776 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 82 [2025-03-17 20:02:29,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:29,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:29,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1, 1, 1] [2025-03-17 20:02:29,778 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 5, 1, 1] [2025-03-17 20:02:29,778 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" [2025-03-17 20:02:29,778 INFO L754 eck$LassoCheckResult]: Loop: "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" [2025-03-17 20:02:29,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:29,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1738623015, now seen corresponding path program 6 times [2025-03-17 20:02:29,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:29,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287239561] [2025-03-17 20:02:29,779 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:02:29,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:29,786 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 6 equivalence classes. [2025-03-17 20:02:29,806 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:02:29,807 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-17 20:02:29,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:29,807 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:29,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 20:02:29,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:02:29,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:29,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:29,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:29,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:29,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1230227096, now seen corresponding path program 16 times [2025-03-17 20:02:29,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:29,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35641358] [2025-03-17 20:02:29,819 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:29,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:29,824 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-17 20:02:29,827 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:02:29,827 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:29,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:29,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:29,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:02:29,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:02:29,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:29,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:29,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:29,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:29,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1704230398, now seen corresponding path program 21 times [2025-03-17 20:02:29,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:29,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629696850] [2025-03-17 20:02:29,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:29,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 8 equivalence classes. [2025-03-17 20:02:29,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 20:02:29,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 20:02:29,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:29,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:29,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 20:02:29,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 20:02:29,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:29,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:29,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:32,176 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:32,176 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:32,176 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:32,176 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:32,176 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:32,176 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,176 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:32,176 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:32,176 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration28_Lasso [2025-03-17 20:02:32,177 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:32,177 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:32,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,682 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:32,683 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:32,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,685 INFO L229 MonitoredProcess]: Starting monitored process 170 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) [2025-03-17 20:02:32,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-03-17 20:02:32,687 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 [2025-03-17 20:02:32,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:32,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:32,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:32,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:32,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:32,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:32,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:32,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:32,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2025-03-17 20:02:32,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,705 INFO L229 MonitoredProcess]: Starting monitored process 171 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) [2025-03-17 20:02:32,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-03-17 20:02:32,707 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 [2025-03-17 20:02:32,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:32,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:32,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:32,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:32,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:32,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:32,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:32,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:32,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:32,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,729 INFO L229 MonitoredProcess]: Starting monitored process 172 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) [2025-03-17 20:02:32,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2025-03-17 20:02:32,730 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 [2025-03-17 20:02:32,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:32,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:32,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:32,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:32,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:32,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:32,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:32,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2025-03-17 20:02:32,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,751 INFO L229 MonitoredProcess]: Starting monitored process 173 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) [2025-03-17 20:02:32,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2025-03-17 20:02:32,753 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 [2025-03-17 20:02:32,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:32,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:32,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:32,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:32,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:32,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:32,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:32,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:32,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2025-03-17 20:02:32,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,772 INFO L229 MonitoredProcess]: Starting monitored process 174 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) [2025-03-17 20:02:32,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2025-03-17 20:02:32,773 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 [2025-03-17 20:02:32,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:32,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:32,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:32,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:32,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:32,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:32,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:32,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:32,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2025-03-17 20:02:32,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,792 INFO L229 MonitoredProcess]: Starting monitored process 175 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) [2025-03-17 20:02:32,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2025-03-17 20:02:32,794 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 [2025-03-17 20:02:32,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:32,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:32,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:32,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:32,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:32,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:32,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:32,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:32,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2025-03-17 20:02:32,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,812 INFO L229 MonitoredProcess]: Starting monitored process 176 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) [2025-03-17 20:02:32,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2025-03-17 20:02:32,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:32,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:32,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:32,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:32,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:32,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:32,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:32,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:32,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2025-03-17 20:02:32,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,834 INFO L229 MonitoredProcess]: Starting monitored process 177 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) [2025-03-17 20:02:32,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2025-03-17 20:02:32,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:32,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:32,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:32,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:32,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:32,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:32,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:32,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:32,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:32,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2025-03-17 20:02:32,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,853 INFO L229 MonitoredProcess]: Starting monitored process 178 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) [2025-03-17 20:02:32,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2025-03-17 20:02:32,855 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 [2025-03-17 20:02:32,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:32,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:32,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:32,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:32,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:32,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:32,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:32,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:32,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2025-03-17 20:02:32,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,872 INFO L229 MonitoredProcess]: Starting monitored process 179 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) [2025-03-17 20:02:32,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2025-03-17 20:02:32,874 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 [2025-03-17 20:02:32,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:32,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:32,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:32,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:32,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:32,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:32,886 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:32,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2025-03-17 20:02:32,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,893 INFO L229 MonitoredProcess]: Starting monitored process 180 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) [2025-03-17 20:02:32,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2025-03-17 20:02:32,895 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 [2025-03-17 20:02:32,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:32,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:32,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:32,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:32,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:32,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:32,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:32,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:32,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,917 INFO L229 MonitoredProcess]: Starting monitored process 181 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) [2025-03-17 20:02:32,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-03-17 20:02:32,919 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 [2025-03-17 20:02:32,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:32,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:32,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:32,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:32,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:32,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:32,948 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:32,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:32,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,956 INFO L229 MonitoredProcess]: Starting monitored process 182 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) [2025-03-17 20:02:32,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2025-03-17 20:02:32,957 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 [2025-03-17 20:02:32,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:32,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:32,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:32,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:32,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:32,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:32,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:32,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2025-03-17 20:02:32,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,978 INFO L229 MonitoredProcess]: Starting monitored process 183 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) [2025-03-17 20:02:32,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2025-03-17 20:02:32,980 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 [2025-03-17 20:02:32,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:32,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:32,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:32,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:32,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:32,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:33,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:33,013 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 20:02:33,013 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 20:02:33,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,015 INFO L229 MonitoredProcess]: Starting monitored process 184 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) [2025-03-17 20:02:33,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2025-03-17 20:02:33,016 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:33,026 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:33,026 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:33,026 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~n#1, ULTIMATE.start_sort_~pass~0#1) = 1*ULTIMATE.start_sort_~n#1 - 1*ULTIMATE.start_sort_~pass~0#1 Supporting invariants [] [2025-03-17 20:02:33,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2025-03-17 20:02:33,038 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-17 20:02:33,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:33,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 20:02:33,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:02:33,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:33,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:33,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:33,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:33,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:02:33,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:02:33,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:33,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:33,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 20:02:33,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:33,179 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2025-03-17 20:02:33,179 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 623 states and 843 transitions. cyclomatic complexity: 243 Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 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) [2025-03-17 20:02:33,203 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 623 states and 843 transitions. cyclomatic complexity: 243. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 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) Result 1388 states and 1981 transitions. Complement of second has 6 states. [2025-03-17 20:02:33,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 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) [2025-03-17 20:02:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2025-03-17 20:02:33,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 29 letters. Loop has 17 letters. [2025-03-17 20:02:33,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:33,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 46 letters. Loop has 17 letters. [2025-03-17 20:02:33,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:33,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 29 letters. Loop has 34 letters. [2025-03-17 20:02:33,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:33,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1388 states and 1981 transitions. [2025-03-17 20:02:33,210 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-03-17 20:02:33,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1388 states to 729 states and 1034 transitions. [2025-03-17 20:02:33,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2025-03-17 20:02:33,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2025-03-17 20:02:33,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 729 states and 1034 transitions. [2025-03-17 20:02:33,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:33,215 INFO L218 hiAutomatonCegarLoop]: Abstraction has 729 states and 1034 transitions. [2025-03-17 20:02:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states and 1034 transitions. [2025-03-17 20:02:33,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 431. [2025-03-17 20:02:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 431 states have (on average 1.4222737819025522) internal successors, (613), 430 states have internal predecessors, (613), 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) [2025-03-17 20:02:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 613 transitions. [2025-03-17 20:02:33,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 431 states and 613 transitions. [2025-03-17 20:02:33,221 INFO L432 stractBuchiCegarLoop]: Abstraction has 431 states and 613 transitions. [2025-03-17 20:02:33,221 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-03-17 20:02:33,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 431 states and 613 transitions. [2025-03-17 20:02:33,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-17 20:02:33,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:33,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:33,221 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 4, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 20:02:33,221 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:02:33,222 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:33,222 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:33,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1462582563, now seen corresponding path program 5 times [2025-03-17 20:02:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:33,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512995362] [2025-03-17 20:02:33,222 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:33,232 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 8 equivalence classes. [2025-03-17 20:02:33,244 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:02:33,244 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-17 20:02:33,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:33,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:33,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 20:02:33,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:02:33,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:33,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:33,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:33,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:33,259 INFO L85 PathProgramCache]: Analyzing trace with hash 35720, now seen corresponding path program 5 times [2025-03-17 20:02:33,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:33,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131846975] [2025-03-17 20:02:33,259 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:33,262 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:33,263 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:33,263 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:02:33,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:33,263 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:33,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:33,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:33,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:33,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:33,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:33,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:33,266 INFO L85 PathProgramCache]: Analyzing trace with hash -646077658, now seen corresponding path program 6 times [2025-03-17 20:02:33,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:33,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015574755] [2025-03-17 20:02:33,266 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:02:33,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:33,275 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 8 equivalence classes. [2025-03-17 20:02:33,301 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 20:02:33,301 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-17 20:02:33,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:33,301 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:33,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 20:02:33,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 20:02:33,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:33,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:33,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:36,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2025-03-17 20:02:54,599 WARN L286 SmtUtils]: Spent 21.20s on a formula simplification. DAG size of input: 327 DAG size of output: 242 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 20:02:56,786 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:56,786 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:56,786 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:56,786 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:56,786 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:56,786 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:56,786 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:56,786 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:56,786 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration29_Lasso [2025-03-17 20:02:56,786 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:56,786 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:56,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:56,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:56,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:56,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:56,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:56,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:57,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:57,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:57,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:57,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:57,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:57,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:57,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:57,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:57,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:57,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:57,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:57,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:57,863 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:57,863 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:57,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:57,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:57,865 INFO L229 MonitoredProcess]: Starting monitored process 185 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) [2025-03-17 20:02:57,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2025-03-17 20:02:57,869 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 [2025-03-17 20:02:57,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:57,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:57,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:57,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:57,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:57,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:57,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:57,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:57,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:57,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:57,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:57,887 INFO L229 MonitoredProcess]: Starting monitored process 186 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) [2025-03-17 20:02:57,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2025-03-17 20:02:57,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:57,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:57,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:57,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:57,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:57,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:57,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:57,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:57,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:57,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2025-03-17 20:02:57,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:57,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:57,908 INFO L229 MonitoredProcess]: Starting monitored process 187 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) [2025-03-17 20:02:57,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2025-03-17 20:02:57,909 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 [2025-03-17 20:02:57,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:57,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:57,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:57,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:57,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:57,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:57,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:57,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:57,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:57,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:57,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:57,927 INFO L229 MonitoredProcess]: Starting monitored process 188 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) [2025-03-17 20:02:57,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2025-03-17 20:02:57,929 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 [2025-03-17 20:02:57,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:57,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:57,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:57,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:57,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:57,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:57,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:57,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2025-03-17 20:02:57,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:57,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:57,949 INFO L229 MonitoredProcess]: Starting monitored process 189 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) [2025-03-17 20:02:57,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2025-03-17 20:02:57,951 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 [2025-03-17 20:02:57,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:57,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:57,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:57,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:57,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:57,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:57,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:57,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:57,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2025-03-17 20:02:57,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:57,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:57,969 INFO L229 MonitoredProcess]: Starting monitored process 190 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) [2025-03-17 20:02:57,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-03-17 20:02:57,973 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 [2025-03-17 20:02:57,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:57,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:57,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:57,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:57,984 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:57,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:57,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:57,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2025-03-17 20:02:57,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:57,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:57,994 INFO L229 MonitoredProcess]: Starting monitored process 191 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) [2025-03-17 20:02:57,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2025-03-17 20:02:57,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:58,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:58,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:58,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:58,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:58,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:58,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:58,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:58,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2025-03-17 20:02:58,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:58,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:58,016 INFO L229 MonitoredProcess]: Starting monitored process 192 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) [2025-03-17 20:02:58,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2025-03-17 20:02:58,018 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 [2025-03-17 20:02:58,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:58,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:58,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:58,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:58,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:58,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:58,039 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:58,071 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver. [2025-03-17 20:02:58,071 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-17 20:02:58,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:58,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:58,073 INFO L229 MonitoredProcess]: Starting monitored process 193 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) [2025-03-17 20:02:58,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2025-03-17 20:02:58,074 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:58,084 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-17 20:02:58,084 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:58,084 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~n#1, ULTIMATE.start_sort_~i~0#1) = 7*ULTIMATE.start_sort_~n#1 - 2*ULTIMATE.start_sort_~i~0#1 Supporting invariants [1*ULTIMATE.start_sort_~n#1 - 1 >= 0] [2025-03-17 20:02:58,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2025-03-17 20:02:58,124 INFO L156 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2025-03-17 20:02:58,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:58,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 20:02:58,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:02:58,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:58,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:58,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 20:02:58,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:58,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:58,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:58,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:58,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:58,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:02:58,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:58,399 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2025-03-17 20:02:58,399 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 431 states and 613 transitions. cyclomatic complexity: 195 Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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) [2025-03-17 20:02:58,464 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 431 states and 613 transitions. cyclomatic complexity: 195. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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) Result 435 states and 619 transitions. Complement of second has 12 states. [2025-03-17 20:02:58,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 10 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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) [2025-03-17 20:02:58,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2025-03-17 20:02:58,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 19 transitions. Stem has 33 letters. Loop has 3 letters. [2025-03-17 20:02:58,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:58,465 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:58,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:58,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 20:02:58,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:02:58,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:58,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:58,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 20:02:58,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:58,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:58,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:58,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:58,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:58,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:02:58,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:58,696 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 2 loop predicates [2025-03-17 20:02:58,696 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 431 states and 613 transitions. cyclomatic complexity: 195 Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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) [2025-03-17 20:02:58,749 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 431 states and 613 transitions. cyclomatic complexity: 195. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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) Result 435 states and 619 transitions. Complement of second has 12 states. [2025-03-17 20:02:58,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 10 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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) [2025-03-17 20:02:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2025-03-17 20:02:58,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 19 transitions. Stem has 33 letters. Loop has 3 letters. [2025-03-17 20:02:58,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:58,749 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:58,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:58,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 20:02:58,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:02:58,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:58,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:58,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 20:02:58,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:58,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:58,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:58,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:58,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:58,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:02:58,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:59,013 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2025-03-17 20:02:59,014 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 431 states and 613 transitions. cyclomatic complexity: 195 Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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) [2025-03-17 20:02:59,122 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 431 states and 613 transitions. cyclomatic complexity: 195. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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) Result 991 states and 1447 transitions. Complement of second has 18 states. [2025-03-17 20:02:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 11 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 20:02:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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) [2025-03-17 20:02:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 40 transitions. [2025-03-17 20:02:59,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 40 transitions. Stem has 33 letters. Loop has 3 letters. [2025-03-17 20:02:59,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:59,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 40 transitions. Stem has 36 letters. Loop has 3 letters. [2025-03-17 20:02:59,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:59,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 40 transitions. Stem has 33 letters. Loop has 6 letters. [2025-03-17 20:02:59,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:59,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 991 states and 1447 transitions. [2025-03-17 20:02:59,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-17 20:02:59,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 991 states to 785 states and 1105 transitions. [2025-03-17 20:02:59,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-17 20:02:59,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-03-17 20:02:59,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 785 states and 1105 transitions. [2025-03-17 20:02:59,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:59,128 INFO L218 hiAutomatonCegarLoop]: Abstraction has 785 states and 1105 transitions. [2025-03-17 20:02:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states and 1105 transitions. [2025-03-17 20:02:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 561. [2025-03-17 20:02:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 561 states have (on average 1.3850267379679144) internal successors, (777), 560 states have internal predecessors, (777), 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) [2025-03-17 20:02:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 777 transitions. [2025-03-17 20:02:59,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 561 states and 777 transitions. [2025-03-17 20:02:59,133 INFO L432 stractBuchiCegarLoop]: Abstraction has 561 states and 777 transitions. [2025-03-17 20:02:59,133 INFO L338 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-03-17 20:02:59,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 561 states and 777 transitions. [2025-03-17 20:02:59,134 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-17 20:02:59,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:59,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:59,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 6, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-17 20:02:59,135 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:02:59,135 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:59,135 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:02:59,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:59,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1962943433, now seen corresponding path program 7 times [2025-03-17 20:02:59,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:59,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436334501] [2025-03-17 20:02:59,135 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:02:59,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:59,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 20:02:59,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:02:59,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:59,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:59,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2025-03-17 20:02:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 29 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:59,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:59,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436334501] [2025-03-17 20:02:59,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436334501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:59,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071968292] [2025-03-17 20:02:59,418 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:02:59,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:59,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:59,420 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:59,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (194)] Waiting until timeout for monitored process [2025-03-17 20:02:59,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 20:02:59,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:02:59,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:59,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:59,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 20:02:59,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:59,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:03:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:03:00,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071968292] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:03:00,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:03:00,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2025-03-17 20:03:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946451770] [2025-03-17 20:03:00,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:03:00,036 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:03:00,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:00,036 INFO L85 PathProgramCache]: Analyzing trace with hash 35720, now seen corresponding path program 6 times [2025-03-17 20:03:00,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:00,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293067375] [2025-03-17 20:03:00,036 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:03:00,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:00,040 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:03:00,041 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:03:00,041 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 20:03:00,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:00,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:00,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:03:00,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:03:00,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:00,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:00,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:00,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:00,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 20:03:00,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1016, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 20:03:00,127 INFO L87 Difference]: Start difference. First operand 561 states and 777 transitions. cyclomatic complexity: 235 Second operand has 36 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 36 states have internal predecessors, (78), 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) [2025-03-17 20:03:00,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:00,317 INFO L93 Difference]: Finished difference Result 691 states and 960 transitions. [2025-03-17 20:03:00,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 691 states and 960 transitions. [2025-03-17 20:03:00,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-17 20:03:00,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 691 states to 666 states and 930 transitions. [2025-03-17 20:03:00,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-03-17 20:03:00,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-03-17 20:03:00,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 666 states and 930 transitions. [2025-03-17 20:03:00,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:00,320 INFO L218 hiAutomatonCegarLoop]: Abstraction has 666 states and 930 transitions. [2025-03-17 20:03:00,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states and 930 transitions. [2025-03-17 20:03:00,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 579. [2025-03-17 20:03:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 579 states have (on average 1.379965457685665) internal successors, (799), 578 states have internal predecessors, (799), 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) [2025-03-17 20:03:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 799 transitions. [2025-03-17 20:03:00,327 INFO L240 hiAutomatonCegarLoop]: Abstraction has 579 states and 799 transitions. [2025-03-17 20:03:00,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 20:03:00,328 INFO L432 stractBuchiCegarLoop]: Abstraction has 579 states and 799 transitions. [2025-03-17 20:03:00,328 INFO L338 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2025-03-17 20:03:00,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 579 states and 799 transitions. [2025-03-17 20:03:00,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-17 20:03:00,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:00,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:00,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 7, 4, 3, 2, 1, 1, 1, 1, 1] [2025-03-17 20:03:00,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:03:00,329 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "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;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "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;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:03:00,329 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-03-17 20:03:00,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:00,330 INFO L85 PathProgramCache]: Analyzing trace with hash -213606329, now seen corresponding path program 8 times [2025-03-17 20:03:00,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:00,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004156600] [2025-03-17 20:03:00,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:03:00,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:00,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-17 20:03:00,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 20:03:00,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:03:00,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:00,351 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:00,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 20:03:00,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 20:03:00,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:00,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:00,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:00,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash 35720, now seen corresponding path program 7 times [2025-03-17 20:03:00,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:00,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132161045] [2025-03-17 20:03:00,369 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:03:00,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:00,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:03:00,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:03:00,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:00,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:00,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:00,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:03:00,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:03:00,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:00,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:00,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:00,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:00,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1595391362, now seen corresponding path program 9 times [2025-03-17 20:03:00,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:00,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101938874] [2025-03-17 20:03:00,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:03:00,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:00,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 9 equivalence classes. [2025-03-17 20:03:00,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 20:03:00,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-17 20:03:00,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:00,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:00,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 20:03:00,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 20:03:00,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:00,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:00,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:29,279 WARN L286 SmtUtils]: Spent 28.76s on a formula simplification. DAG size of input: 368 DAG size of output: 269 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)