./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 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/reducercommutativity/max05-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 4e48915cf0eaefe43320bbe59bf88f5c68b2f305d293e808fa6ece9112b5c238 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:43:40,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:43:40,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:43:40,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:43:40,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:43:40,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:43:40,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:43:40,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:43:40,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:43:40,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:43:40,767 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:43:40,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:43:40,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:43:40,767 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:43:40,767 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:43:40,767 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:43:40,767 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:43:40,767 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:43:40,767 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:43:40,768 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:43:40,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:43:40,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:43:40,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:43:40,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:43:40,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:43:40,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:43:40,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:43:40,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:43:40,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:43:40,768 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:43:40,769 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:43:40,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:43:40,769 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:43:40,769 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:43:40,769 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:43:40,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:43:40,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:43:40,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:43:40,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:43:40,769 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:43:40,770 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 -> 4e48915cf0eaefe43320bbe59bf88f5c68b2f305d293e808fa6ece9112b5c238 [2025-03-04 15:43:40,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:43:40,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:43:40,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:43:40,989 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:43:40,990 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:43:40,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max05-1.i [2025-03-04 15:43:42,142 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8b44080/da8efbf2d3304771ad95e847eec7e2bc/FLAG8359843fb [2025-03-04 15:43:42,377 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:43:42,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i [2025-03-04 15:43:42,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8b44080/da8efbf2d3304771ad95e847eec7e2bc/FLAG8359843fb [2025-03-04 15:43:42,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8b44080/da8efbf2d3304771ad95e847eec7e2bc [2025-03-04 15:43:42,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:43:42,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:43:42,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:43:42,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:43:42,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:43:42,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:43:42" (1/1) ... [2025-03-04 15:43:42,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e94e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42, skipping insertion in model container [2025-03-04 15:43:42,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:43:42" (1/1) ... [2025-03-04 15:43:42,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:43:42,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:43:42,559 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:43:42,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:43:42,592 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:43:42,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42 WrapperNode [2025-03-04 15:43:42,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:43:42,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:43:42,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:43:42,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:43:42,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42" (1/1) ... [2025-03-04 15:43:42,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42" (1/1) ... [2025-03-04 15:43:42,624 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2025-03-04 15:43:42,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:43:42,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:43:42,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:43:42,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:43:42,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42" (1/1) ... [2025-03-04 15:43:42,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42" (1/1) ... [2025-03-04 15:43:42,634 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42" (1/1) ... [2025-03-04 15:43:42,647 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-04 15:43:42,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42" (1/1) ... [2025-03-04 15:43:42,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42" (1/1) ... [2025-03-04 15:43:42,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42" (1/1) ... [2025-03-04 15:43:42,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42" (1/1) ... [2025-03-04 15:43:42,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42" (1/1) ... [2025-03-04 15:43:42,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42" (1/1) ... [2025-03-04 15:43:42,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:43:42,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:43:42,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:43:42,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:43:42,664 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42" (1/1) ... [2025-03-04 15:43:42,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:42,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:42,692 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-04 15:43:42,699 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-04 15:43:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:43:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:43:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:43:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:43:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:43:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:43:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:43:42,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:43:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:43:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:43:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:43:42,775 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:43:42,777 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:43:42,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-04 15:43:42,974 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-04 15:43:42,974 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:43:42,980 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:43:42,980 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:43:42,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:43:42 BoogieIcfgContainer [2025-03-04 15:43:42,981 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:43:42,981 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:43:42,981 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:43:42,986 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:43:42,986 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:43:42,987 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:43:42" (1/3) ... [2025-03-04 15:43:42,989 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cc95b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:43:42, skipping insertion in model container [2025-03-04 15:43:42,989 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:43:42,989 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:42" (2/3) ... [2025-03-04 15:43:42,989 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cc95b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:43:42, skipping insertion in model container [2025-03-04 15:43:42,990 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:43:42,990 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:43:42" (3/3) ... [2025-03-04 15:43:42,991 INFO L363 chiAutomizerObserver]: Analyzing ICFG max05-1.i [2025-03-04 15:43:43,034 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:43:43,035 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:43:43,035 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:43:43,036 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:43:43,036 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:43:43,036 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:43:43,036 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:43:43,036 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:43:43,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:43,052 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2025-03-04 15:43:43,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:43,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:43,055 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:43:43,056 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:43,056 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:43:43,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:43,057 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2025-03-04 15:43:43,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:43,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:43,058 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:43:43,058 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:43,062 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" [2025-03-04 15:43:43,062 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" [2025-03-04 15:43:43,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:43,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2080, now seen corresponding path program 1 times [2025-03-04 15:43:43,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:43,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490793956] [2025-03-04 15:43:43,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:43,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:43,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:43:43,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:43:43,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:43,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:43,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:43,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:43:43,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:43:43,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:43,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:43,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:43,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:43,156 INFO L85 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 1 times [2025-03-04 15:43:43,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:43,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120539298] [2025-03-04 15:43:43,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:43,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:43,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:43,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:43,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:43,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:43,171 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:43,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:43,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:43,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:43,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:43,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:43,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:43,181 INFO L85 PathProgramCache]: Analyzing trace with hash 64513, now seen corresponding path program 1 times [2025-03-04 15:43:43,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:43,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270458194] [2025-03-04 15:43:43,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:43,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:43,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:43,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:43,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:43,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:43,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:43,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:43,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:43,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:43,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:43,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:43,451 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:43:43,451 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:43:43,451 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:43:43,451 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:43:43,452 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:43:43,452 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:43,452 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:43:43,452 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:43:43,452 INFO L132 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration1_Lasso [2025-03-04 15:43:43,452 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:43:43,452 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:43:43,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:43,830 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:43:43,834 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:43:43,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:43,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:43,843 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-04 15:43:43,844 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-04 15:43:43,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:43,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:43,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:43,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:43,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:43,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:43,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:43,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:43,862 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:43,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:43:43,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:43,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:43,870 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-04 15:43:43,871 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-04 15:43:43,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-04 15:43:43,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:43,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:43,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:43,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:43,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:43,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:43,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:43,895 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-04 15:43:43,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:43,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:43,897 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-04 15:43:43,899 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-04 15:43:43,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:43,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:43,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:43,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:43,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:43,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:43,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:43,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:43,922 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-04 15:43:43,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:43,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:43,925 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-04 15:43:43,926 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-04 15:43:43,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:43,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:43,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:43,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:43,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:43,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:43,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:43,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:43,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:43,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:43,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:43,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:43,948 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-04 15:43:43,949 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-04 15:43:43,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-04 15:43:43,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:43,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:43,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:43,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:43,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:43,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:43,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:43,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:43,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-04 15:43:43,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:43,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:43,970 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-04 15:43:43,970 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-04 15:43:43,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:43,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:43,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:43,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:43,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:43,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:43,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:43,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:43,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:43,990 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-04 15:43:43,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:43,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:43,992 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-04 15:43:43,993 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-04 15:43:43,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:44,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:44,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:44,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:44,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:44,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:44,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:44,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:44,006 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:44,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:44,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:44,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:44,014 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-04 15:43:44,015 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-04 15:43:44,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-04 15:43:44,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:44,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:44,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:44,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:44,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:44,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:44,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:44,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:44,033 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-04 15:43:44,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:44,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:44,036 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-04 15:43:44,037 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-04 15:43:44,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:44,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:44,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:44,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:44,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:44,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:44,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:44,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:44,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:44,056 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-04 15:43:44,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:44,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:44,058 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-04 15:43:44,059 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-04 15:43:44,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-04 15:43:44,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:44,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:44,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:44,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:44,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:44,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:44,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:44,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:44,080 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-04 15:43:44,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:44,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:44,082 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-04 15:43:44,083 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-04 15:43:44,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:44,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:44,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:44,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:44,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:44,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:44,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:44,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:44,096 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:44,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 15:43:44,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:44,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:44,103 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-04 15:43:44,105 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-04 15:43:44,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:44,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:44,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:44,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:44,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:44,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:44,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:44,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:44,117 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:44,122 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-04 15:43:44,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:44,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:44,125 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-04 15:43:44,126 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-04 15:43:44,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:44,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:44,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:44,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:44,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:44,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:44,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:44,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:44,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:44,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:44,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:44,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:44,147 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:44,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 15:43:44,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:44,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:44,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:44,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:44,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:44,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:44,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:44,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:44,162 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:44,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:44,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:44,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:44,169 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-04 15:43:44,170 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-04 15:43:44,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:44,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:44,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:44,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:44,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:44,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:44,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:44,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:44,191 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-04 15:43:44,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:44,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:44,192 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-04 15:43:44,194 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-04 15:43:44,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:44,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:44,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:44,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:44,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:44,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:44,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:44,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:44,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:44,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:44,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:44,217 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-04 15:43:44,218 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-04 15:43:44,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:44,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:44,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:44,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:44,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:44,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:44,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:44,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:44,240 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-04 15:43:44,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:44,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:44,243 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-04 15:43:44,245 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-04 15:43:44,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-04 15:43:44,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:44,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:44,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:44,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:44,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:44,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:44,266 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:43:44,288 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-04 15:43:44,290 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-04 15:43:44,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:44,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:44,293 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-04 15:43:44,295 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-04 15:43:44,296 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:43:44,307 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:43:44,307 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:43:44,308 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2025-03-04 15:43:44,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 15:43:44,324 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-04 15:43:44,330 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:43:44,331 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:43:44,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:44,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:43:44,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:43:44,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:44,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:44,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:43:44,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:44,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:44,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:44,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:44,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:44,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:43:44,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:44,373 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-04 15:43:44,392 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-04 15:43:44,394 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-04 15:43:44,413 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 25 states and 36 transitions. Complement of second has 3 states. [2025-03-04 15:43:44,415 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-04 15:43:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-04 15:43:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-03-04 15:43:44,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-04 15:43:44,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:44,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-04 15:43:44,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:44,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-04 15:43:44,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:44,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2025-03-04 15:43:44,424 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-03-04 15:43:44,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 26 transitions. [2025-03-04 15:43:44,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-04 15:43:44,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-04 15:43:44,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 26 transitions. [2025-03-04 15:43:44,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:44,427 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 26 transitions. [2025-03-04 15:43:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 26 transitions. [2025-03-04 15:43:44,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-03-04 15:43:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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-04 15:43:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2025-03-04 15:43:44,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-03-04 15:43:44,441 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-03-04 15:43:44,441 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:43:44,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2025-03-04 15:43:44,441 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-03-04 15:43:44,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:44,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:44,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:43:44,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:43:44,442 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < 5);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" [2025-03-04 15:43:44,442 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" [2025-03-04 15:43:44,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:44,442 INFO L85 PathProgramCache]: Analyzing trace with hash 64512, now seen corresponding path program 1 times [2025-03-04 15:43:44,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:44,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407886138] [2025-03-04 15:43:44,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:44,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:44,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:44,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:44,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:44,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:44,500 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-04 15:43:44,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407886138] [2025-03-04 15:43:44,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407886138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:43:44,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:43:44,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:43:44,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714882180] [2025-03-04 15:43:44,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:43:44,502 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:44,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash 60509, now seen corresponding path program 1 times [2025-03-04 15:43:44,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:44,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265644803] [2025-03-04 15:43:44,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:44,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:44,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:44,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:44,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:44,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:44,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:44,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:44,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:44,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:44,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:44,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:44,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:44,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:43:44,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:43:44,571 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 13 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-04 15:43:44,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:44,577 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2025-03-04 15:43:44,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2025-03-04 15:43:44,578 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-03-04 15:43:44,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 23 transitions. [2025-03-04 15:43:44,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-04 15:43:44,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-03-04 15:43:44,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2025-03-04 15:43:44,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:44,578 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-04 15:43:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2025-03-04 15:43:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-04 15:43:44,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 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-04 15:43:44,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2025-03-04 15:43:44,579 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-04 15:43:44,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:43:44,584 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-04 15:43:44,584 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:43:44,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2025-03-04 15:43:44,584 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-03-04 15:43:44,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:44,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:44,585 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:43:44,585 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:43:44,585 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 5);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" [2025-03-04 15:43:44,585 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" [2025-03-04 15:43:44,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:44,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1999935, now seen corresponding path program 1 times [2025-03-04 15:43:44,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:44,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898189315] [2025-03-04 15:43:44,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:44,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:44,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:43:44,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:43:44,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:44,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:44,643 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-04 15:43:44,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:44,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898189315] [2025-03-04 15:43:44,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898189315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:44,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967849233] [2025-03-04 15:43:44,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:44,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:44,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:44,645 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:43:44,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 15:43:44,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:43:44,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:43:44,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:44,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:44,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:43:44,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:44,692 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-04 15:43:44,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:43:44,713 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-04 15:43:44,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967849233] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:43:44,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:43:44,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 15:43:44,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330456594] [2025-03-04 15:43:44,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:43:44,714 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:44,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:44,714 INFO L85 PathProgramCache]: Analyzing trace with hash 60509, now seen corresponding path program 2 times [2025-03-04 15:43:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:44,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426052431] [2025-03-04 15:43:44,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:44,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:44,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:44,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:44,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:43:44,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:44,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:44,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:44,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:44,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:44,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:44,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:44,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:44,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:43:44,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:43:44,783 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. cyclomatic complexity: 12 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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-04 15:43:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:44,798 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2025-03-04 15:43:44,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2025-03-04 15:43:44,798 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-03-04 15:43:44,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2025-03-04 15:43:44,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-04 15:43:44,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-03-04 15:43:44,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2025-03-04 15:43:44,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:44,799 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-03-04 15:43:44,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2025-03-04 15:43:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-04 15:43:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-04 15:43:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2025-03-04 15:43:44,801 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-03-04 15:43:44,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:43:44,801 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-03-04 15:43:44,801 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:43:44,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2025-03-04 15:43:44,802 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-03-04 15:43:44,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:44,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:44,802 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-03-04 15:43:44,802 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:43:44,802 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 5);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" [2025-03-04 15:43:44,802 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" [2025-03-04 15:43:44,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:44,802 INFO L85 PathProgramCache]: Analyzing trace with hash -549416000, now seen corresponding path program 2 times [2025-03-04 15:43:44,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:44,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471474125] [2025-03-04 15:43:44,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:44,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:44,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-04 15:43:44,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:43:44,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:43:44,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:44,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:44,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471474125] [2025-03-04 15:43:44,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471474125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:44,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945381431] [2025-03-04 15:43:44,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:44,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:44,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:44,903 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-04 15:43:44,929 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-04 15:43:44,935 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-04 15:43:44,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-04 15:43:44,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:43:44,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:43:44,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:44,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:43:44,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:44,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:43:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:45,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945381431] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:43:45,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:43:45,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-03-04 15:43:45,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772143286] [2025-03-04 15:43:45,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:43:45,006 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:45,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:45,006 INFO L85 PathProgramCache]: Analyzing trace with hash 60509, now seen corresponding path program 3 times [2025-03-04 15:43:45,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:45,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563327897] [2025-03-04 15:43:45,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:43:45,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:45,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:45,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:45,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:43:45,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:45,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:45,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:45,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:45,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:45,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:45,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:45,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:43:45,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:43:45,070 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 12 Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 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-04 15:43:45,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:45,082 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2025-03-04 15:43:45,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2025-03-04 15:43:45,083 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-03-04 15:43:45,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2025-03-04 15:43:45,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-04 15:43:45,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-03-04 15:43:45,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2025-03-04 15:43:45,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:45,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-03-04 15:43:45,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2025-03-04 15:43:45,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-04 15:43:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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-04 15:43:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2025-03-04 15:43:45,085 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-03-04 15:43:45,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:43:45,088 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-03-04 15:43:45,088 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:43:45,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2025-03-04 15:43:45,089 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-03-04 15:43:45,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:45,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:45,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1] [2025-03-04 15:43:45,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:43:45,089 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 5);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" [2025-03-04 15:43:45,089 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" [2025-03-04 15:43:45,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:45,090 INFO L85 PathProgramCache]: Analyzing trace with hash 147973247, now seen corresponding path program 3 times [2025-03-04 15:43:45,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:45,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186247413] [2025-03-04 15:43:45,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:43:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:45,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 4 equivalence classes. [2025-03-04 15:43:45,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:43:45,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:43:45,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:45,114 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:45,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:43:45,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:43:45,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:45,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:45,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:45,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:45,132 INFO L85 PathProgramCache]: Analyzing trace with hash 60509, now seen corresponding path program 4 times [2025-03-04 15:43:45,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:45,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196896039] [2025-03-04 15:43:45,132 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:43:45,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:45,134 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 15:43:45,135 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:45,135 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:43:45,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:45,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:45,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:45,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:45,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:45,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:45,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:45,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:45,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1634586399, now seen corresponding path program 1 times [2025-03-04 15:43:45,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:45,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912608536] [2025-03-04 15:43:45,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:45,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:45,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:43:45,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:43:45,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:45,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:45,165 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:45,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:43:45,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:43:45,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:45,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:45,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:45,704 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:43:45,704 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:43:45,704 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:43:45,704 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:43:45,705 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:43:45,705 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:45,705 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:43:45,705 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:43:45,705 INFO L132 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration5_Lasso [2025-03-04 15:43:45,705 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:43:45,705 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:43:45,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:45,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,104 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:43:46,104 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:43:46,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,108 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:46,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 15:43:46,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:46,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:46,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:46,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:46,121 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-04 15:43:46,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,128 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:46,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 15:43:46,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:46,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:46,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:46,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:46,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 15:43:46,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,147 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:46,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 15:43:46,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:46,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:46,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:46,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:46,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 15:43:46,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,166 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:46,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 15:43:46,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:46,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:46,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:46,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:46,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-04 15:43:46,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,186 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-04 15:43:46,187 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-04 15:43:46,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:46,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:46,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:46,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:46,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,204 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-04 15:43:46,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,206 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-04 15:43:46,207 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-04 15:43:46,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:46,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:46,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:46,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:46,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,223 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-04 15:43:46,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,225 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-04 15:43:46,226 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-04 15:43:46,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:46,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:46,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:46,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:46,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,243 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-04 15:43:46,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,244 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-04 15:43:46,246 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-04 15:43:46,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:46,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:46,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:46,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:46,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,263 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-04 15:43:46,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,265 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-04 15:43:46,265 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-04 15:43:46,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:46,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:46,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:46,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,289 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-04 15:43:46,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,291 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-04 15:43:46,292 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-04 15:43:46,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-04 15:43:46,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:46,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:46,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:46,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:46,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,317 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-04 15:43:46,318 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-04 15:43:46,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-04 15:43:46,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:46,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:46,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,338 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-04 15:43:46,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,340 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-04 15:43:46,341 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-04 15:43:46,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:46,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:46,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:46,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,362 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-04 15:43:46,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,364 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-04 15:43:46,366 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-04 15:43:46,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:46,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:46,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:46,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,388 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-04 15:43:46,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,390 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-04 15:43:46,391 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-04 15:43:46,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:46,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:46,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:46,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 15:43:46,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,413 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-04 15:43:46,415 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-04 15:43:46,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:46,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:46,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:46,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:46,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,437 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-04 15:43:46,438 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-04 15:43:46,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:46,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:46,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:46,458 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:43:46,467 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:43:46,467 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-04 15:43:46,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,469 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-04 15:43:46,471 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-04 15:43:46,471 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:43:46,482 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:43:46,482 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:43:46,482 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1) = -2*ULTIMATE.start_max_~i~0#1 + 9 Supporting invariants [] [2025-03-04 15:43:46,487 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-04 15:43:46,499 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-04 15:43:46,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:46,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:43:46,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:43:46,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:46,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:46,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:43:46,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:46,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:46,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:46,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:46,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:46,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:43:46,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:46,552 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-04 15:43:46,552 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-04 15:43:46,553 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-04 15:43:46,568 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 23 states and 33 transitions. Complement of second has 5 states. [2025-03-04 15:43:46,569 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-04 15:43:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-04 15:43:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 15:43:46,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 3 letters. [2025-03-04 15:43:46,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:46,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 11 letters. Loop has 3 letters. [2025-03-04 15:43:46,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:46,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 6 letters. [2025-03-04 15:43:46,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:46,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 33 transitions. [2025-03-04 15:43:46,570 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:43:46,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 29 transitions. [2025-03-04 15:43:46,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 15:43:46,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:43:46,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2025-03-04 15:43:46,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:46,571 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2025-03-04 15:43:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2025-03-04 15:43:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-04 15:43:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-04 15:43:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2025-03-04 15:43:46,572 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2025-03-04 15:43:46,572 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2025-03-04 15:43:46,572 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:43:46,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2025-03-04 15:43:46,572 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:43:46,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:46,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:46,572 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1] [2025-03-04 15:43:46,572 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:43:46,573 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 5);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume !(max_~i~0#1 < 5);max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" [2025-03-04 15:43:46,573 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" [2025-03-04 15:43:46,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:46,573 INFO L85 PathProgramCache]: Analyzing trace with hash 468370461, now seen corresponding path program 1 times [2025-03-04 15:43:46,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:46,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401867832] [2025-03-04 15:43:46,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:46,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:46,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:43:46,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:43:46,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:46,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:43:46,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:46,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401867832] [2025-03-04 15:43:46,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401867832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:43:46,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:43:46,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:43:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186336445] [2025-03-04 15:43:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:43:46,625 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:46,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash 53558, now seen corresponding path program 1 times [2025-03-04 15:43:46,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:46,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213541504] [2025-03-04 15:43:46,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:46,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:46,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:46,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:46,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:46,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:46,629 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:46,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:46,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:46,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:46,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:46,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:46,663 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-04 15:43:46,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:46,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:43:46,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:43:46,689 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:46,713 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2025-03-04 15:43:46,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 39 transitions. [2025-03-04 15:43:46,713 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:43:46,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 39 transitions. [2025-03-04 15:43:46,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-04 15:43:46,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-04 15:43:46,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2025-03-04 15:43:46,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:46,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-03-04 15:43:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2025-03-04 15:43:46,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2025-03-04 15:43:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 states have internal predecessors, (29), 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-04 15:43:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-03-04 15:43:46,715 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-04 15:43:46,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:43:46,715 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-04 15:43:46,715 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:43:46,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2025-03-04 15:43:46,716 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:43:46,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:46,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:46,716 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:43:46,716 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:43:46,716 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 5);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume !(max_~i~0#1 < 5);max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" [2025-03-04 15:43:46,716 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" [2025-03-04 15:43:46,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:46,717 INFO L85 PathProgramCache]: Analyzing trace with hash -374839172, now seen corresponding path program 1 times [2025-03-04 15:43:46,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:46,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052677390] [2025-03-04 15:43:46,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:46,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:46,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:43:46,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:43:46,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:46,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:43:46,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052677390] [2025-03-04 15:43:46,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052677390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289540874] [2025-03-04 15:43:46,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:46,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:46,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,785 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:43:46,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-03-04 15:43:46,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:43:46,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:43:46,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:46,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:46,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:43:46,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:43:46,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:43:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:43:46,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289540874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:43:46,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:43:46,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 15:43:46,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922086581] [2025-03-04 15:43:46,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:43:46,865 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:46,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash 51608, now seen corresponding path program 2 times [2025-03-04 15:43:46,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:46,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013932230] [2025-03-04 15:43:46,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:46,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:46,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:46,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:43:46,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:46,870 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:46,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:46,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:46,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:46,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:46,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:46,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:46,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:43:46,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:43:46,932 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-04 15:43:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:47,000 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2025-03-04 15:43:47,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2025-03-04 15:43:47,000 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:43:47,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 66 transitions. [2025-03-04 15:43:47,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-03-04 15:43:47,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-03-04 15:43:47,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 66 transitions. [2025-03-04 15:43:47,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:47,001 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 66 transitions. [2025-03-04 15:43:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 66 transitions. [2025-03-04 15:43:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2025-03-04 15:43:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.325) internal successors, (53), 39 states have internal predecessors, (53), 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-04 15:43:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2025-03-04 15:43:47,003 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 53 transitions. [2025-03-04 15:43:47,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:43:47,006 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2025-03-04 15:43:47,006 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:43:47,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2025-03-04 15:43:47,007 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:43:47,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:47,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:47,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 15:43:47,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:43:47,007 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 5);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume !(max_~i~0#1 < 5);max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" [2025-03-04 15:43:47,007 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" [2025-03-04 15:43:47,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash 690129215, now seen corresponding path program 1 times [2025-03-04 15:43:47,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:47,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909730175] [2025-03-04 15:43:47,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:47,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:43:47,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:43:47,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:43:47,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:47,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909730175] [2025-03-04 15:43:47,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909730175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:47,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501033410] [2025-03-04 15:43:47,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:47,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:47,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:47,113 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:43:47,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-03-04 15:43:47,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:43:47,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:43:47,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:47,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:43:47,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:43:47,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:43:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:43:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501033410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:43:47,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:43:47,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-03-04 15:43:47,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846950507] [2025-03-04 15:43:47,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:43:47,243 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:47,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash 51608, now seen corresponding path program 3 times [2025-03-04 15:43:47,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:47,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927823467] [2025-03-04 15:43:47,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:43:47,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:47,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:47,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:47,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:43:47,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:47,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:47,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:47,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:47,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:47,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:43:47,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:43:47,321 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. cyclomatic complexity: 18 Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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-04 15:43:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:47,384 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2025-03-04 15:43:47,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2025-03-04 15:43:47,385 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:43:47,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 78 transitions. [2025-03-04 15:43:47,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-03-04 15:43:47,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-03-04 15:43:47,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 78 transitions. [2025-03-04 15:43:47,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:47,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 78 transitions. [2025-03-04 15:43:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 78 transitions. [2025-03-04 15:43:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2025-03-04 15:43:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 45 states have internal predecessors, (61), 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-04 15:43:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2025-03-04 15:43:47,387 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 61 transitions. [2025-03-04 15:43:47,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:43:47,388 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 61 transitions. [2025-03-04 15:43:47,388 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:43:47,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 61 transitions. [2025-03-04 15:43:47,388 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:43:47,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:47,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:47,389 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 15:43:47,389 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:43:47,389 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 5);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume !(max_~i~0#1 < 5);max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" [2025-03-04 15:43:47,389 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" [2025-03-04 15:43:47,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,389 INFO L85 PathProgramCache]: Analyzing trace with hash -986175172, now seen corresponding path program 2 times [2025-03-04 15:43:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187740586] [2025-03-04 15:43:47,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:47,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 15:43:47,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:43:47,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:43:47,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,417 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:47,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:43:47,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:43:47,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:47,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,444 INFO L85 PathProgramCache]: Analyzing trace with hash 51608, now seen corresponding path program 4 times [2025-03-04 15:43:47,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:47,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696923187] [2025-03-04 15:43:47,444 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:43:47,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:47,448 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 15:43:47,449 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:47,449 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:43:47,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:47,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:47,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:47,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:47,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1568222595, now seen corresponding path program 1 times [2025-03-04 15:43:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:47,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443066244] [2025-03-04 15:43:47,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:47,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:47,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 15:43:47,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:43:47,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 15:43:47,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:47,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443066244] [2025-03-04 15:43:47,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443066244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:47,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888897207] [2025-03-04 15:43:47,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:47,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:47,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:47,566 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:43:47,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-03-04 15:43:47,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 15:43:47,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:43:47,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:47,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:43:47,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 15:43:47,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:43:47,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888897207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:43:47,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:43:47,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2025-03-04 15:43:47,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442458165] [2025-03-04 15:43:47,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:43:47,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:47,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:43:47,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:43:47,707 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. cyclomatic complexity: 20 Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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-04 15:43:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:47,803 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2025-03-04 15:43:47,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 75 transitions. [2025-03-04 15:43:47,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 15:43:47,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 54 transitions. [2025-03-04 15:43:47,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-04 15:43:47,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-04 15:43:47,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2025-03-04 15:43:47,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:47,804 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-03-04 15:43:47,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2025-03-04 15:43:47,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 15:43:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.255813953488372) internal successors, (54), 42 states have internal predecessors, (54), 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-04 15:43:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2025-03-04 15:43:47,805 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-03-04 15:43:47,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:43:47,808 INFO L432 stractBuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-03-04 15:43:47,808 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:43:47,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 54 transitions. [2025-03-04 15:43:47,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 15:43:47,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:47,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:47,809 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:43:47,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:47,810 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 5;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 5);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume !(max_~i~0#1 < 5);max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 5;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume !(max_~i~0#1 < 5);max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret10#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;call main_#t~mem11#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1;main_~i~2#1 := 0;" [2025-03-04 15:43:47,810 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~2#1 < 4;call main_#t~mem12#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int#1(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" [2025-03-04 15:43:47,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1370230504, now seen corresponding path program 1 times [2025-03-04 15:43:47,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:47,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401277901] [2025-03-04 15:43:47,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:47,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:43:47,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:43:47,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:47,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:43:47,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:43:47,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:47,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times [2025-03-04 15:43:47,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:47,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583163493] [2025-03-04 15:43:47,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:47,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:47,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:47,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,879 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:47,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:47,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:47,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:47,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash 472527353, now seen corresponding path program 1 times [2025-03-04 15:43:47,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:47,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775761905] [2025-03-04 15:43:47,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:47,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:47,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:43:47,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:43:47,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:47,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:43:47,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:43:47,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:51,958 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:43:51,958 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:43:51,958 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:43:51,958 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:43:51,958 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:43:51,958 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:51,958 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:43:51,958 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:43:51,958 INFO L132 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration10_Lasso [2025-03-04 15:43:51,958 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:43:51,958 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:43:51,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:51,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:52,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:52,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:52,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:52,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:52,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:52,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:52,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:52,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:52,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:52,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:52,496 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:43:52,497 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:43:52,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,499 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-04 15:43:52,500 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-04 15:43:52,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,519 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-04 15:43:52,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,521 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-04 15:43:52,525 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-04 15:43:52,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,546 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-04 15:43:52,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,548 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-04 15:43:52,549 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-04 15:43:52,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-04 15:43:52,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,568 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-04 15:43:52,569 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-04 15:43:52,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:52,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,588 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-04 15:43:52,588 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-04 15:43:52,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,605 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-04 15:43:52,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,607 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-04 15:43:52,608 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-04 15:43:52,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-04 15:43:52,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,626 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-04 15:43:52,627 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-04 15:43:52,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:52,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,646 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-04 15:43:52,647 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-04 15:43:52,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,661 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,666 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-04 15:43:52,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,669 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-04 15:43:52,670 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-04 15:43:52,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,687 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-04 15:43:52,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,689 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-04 15:43:52,689 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-04 15:43:52,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,709 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-04 15:43:52,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,711 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-04 15:43:52,712 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-04 15:43:52,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:52,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:52,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:52,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,733 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-04 15:43:52,734 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-04 15:43:52,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,750 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-04 15:43:52,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,753 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-04 15:43:52,754 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-04 15:43:52,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:52,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:52,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,773 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-04 15:43:52,773 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-04 15:43:52,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,790 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-04 15:43:52,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,792 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-04 15:43:52,792 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-04 15:43:52,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,809 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-04 15:43:52,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,811 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-04 15:43:52,812 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-04 15:43:52,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,828 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-04 15:43:52,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,830 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-04 15:43:52,832 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-04 15:43:52,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,848 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-04 15:43:52,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,849 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-04 15:43:52,850 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-04 15:43:52,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-04 15:43:52,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:52,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:52,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,868 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-04 15:43:52,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,870 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-04 15:43:52,870 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-04 15:43:52,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:52,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:52,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:52,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,890 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-04 15:43:52,891 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-04 15:43:52,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:52,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-04 15:43:52,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,909 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-04 15:43:52,909 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-04 15:43:52,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,921 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,925 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-04 15:43:52,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,927 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-04 15:43:52,928 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-04 15:43:52,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-04 15:43:52,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,944 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-04 15:43:52,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,946 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-04 15:43:52,946 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-04 15:43:52,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,963 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-04 15:43:52,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,965 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-04 15:43:52,965 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-04 15:43:52,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:52,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:52,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:52,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:52,983 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-04 15:43:52,984 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-04 15:43:52,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:52,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:52,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:52,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:52,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:52,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:52,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:52,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:52,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:53,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-04 15:43:53,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:53,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:53,002 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-04 15:43:53,002 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-04 15:43:53,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:53,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:53,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:53,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:53,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:53,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:53,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:53,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:53,021 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-04 15:43:53,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:53,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:53,023 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-04 15:43:53,034 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-04 15:43:53,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:53,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:53,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:53,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:53,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:53,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:53,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:53,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:53,046 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:53,051 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-04 15:43:53,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:53,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:53,053 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-04 15:43:53,053 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-04 15:43:53,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:53,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:53,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:53,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:53,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:53,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:53,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:53,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:53,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:53,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:53,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:53,076 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-04 15:43:53,077 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-04 15:43:53,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:53,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:53,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:53,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:53,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:53,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:53,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:53,090 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:53,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-04 15:43:53,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:53,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:53,096 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-04 15:43:53,097 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-04 15:43:53,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:43:53,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:53,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:53,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:53,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:53,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:53,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:53,111 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:53,116 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-04 15:43:53,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:53,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:53,118 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-04 15:43:53,119 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-04 15:43:53,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-04 15:43:53,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:53,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:53,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:53,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:53,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:53,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:53,136 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:43:53,146 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-04 15:43:53,147 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:43:53,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:53,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:53,148 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-04 15:43:53,149 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-04 15:43:53,150 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:43:53,160 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:43:53,160 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:43:53,160 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_3, ULTIMATE.start_main_~i~2#1) = 7*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_3 - 16*ULTIMATE.start_main_~i~2#1 Supporting invariants [] [2025-03-04 15:43:53,165 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-04 15:43:53,173 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-03-04 15:43:53,174 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:43:53,174 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:43:53,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:53,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:43:53,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:43:53,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:53,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:53,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:43:53,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:53,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:53,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:53,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:53,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:53,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:43:53,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:53,273 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-04 15:43:53,273 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-04 15:43:53,274 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 13 Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-04 15:43:53,278 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 13. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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 44 states and 55 transitions. Complement of second has 2 states. [2025-03-04 15:43:53,279 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-04 15:43:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-04 15:43:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 17 transitions. [2025-03-04 15:43:53,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 17 transitions. Stem has 42 letters. Loop has 1 letters. [2025-03-04 15:43:53,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:53,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 17 transitions. Stem has 43 letters. Loop has 1 letters. [2025-03-04 15:43:53,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:53,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 17 transitions. Stem has 42 letters. Loop has 2 letters. [2025-03-04 15:43:53,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:53,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2025-03-04 15:43:53,281 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:43:53,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2025-03-04 15:43:53,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:43:53,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:43:53,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:43:53,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:53,281 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:43:53,281 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:43:53,281 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:43:53,281 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 15:43:53,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:43:53,281 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:43:53,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:43:53,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:43:53 BoogieIcfgContainer [2025-03-04 15:43:53,288 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:43:53,288 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:43:53,288 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:43:53,288 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:43:53,289 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:43:42" (3/4) ... [2025-03-04 15:43:53,290 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:43:53,290 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:43:53,291 INFO L158 Benchmark]: Toolchain (without parser) took 10883.27ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 123.1MB in the beginning and 133.3MB in the end (delta: -10.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2025-03-04 15:43:53,291 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:43:53,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.32ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 112.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:43:53,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.33ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:43:53,291 INFO L158 Benchmark]: Boogie Preprocessor took 37.70ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:43:53,291 INFO L158 Benchmark]: IcfgBuilder took 317.89ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 93.2MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:43:53,291 INFO L158 Benchmark]: BuchiAutomizer took 10306.27ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 92.8MB in the beginning and 133.3MB in the end (delta: -40.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:43:53,292 INFO L158 Benchmark]: Witness Printer took 2.20ms. Allocated memory is still 201.3MB. Free memory was 133.3MB in the beginning and 133.3MB in the end (delta: 55.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:43:53,292 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.32ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 112.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.33ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.70ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 317.89ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 93.2MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 10306.27ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 92.8MB in the beginning and 133.3MB in the end (delta: -40.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.20ms. Allocated memory is still 201.3MB. Free memory was 133.3MB in the beginning and 133.3MB in the end (delta: 55.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (7 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 2 locations. One deterministic module has affine ranking function (9 + ((long long) -2 * i)) and consists of 3 locations. One deterministic module has affine ranking function null and consists of 2 locations. 7 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 11 iterations. TraceHistogramMax:5. Analysis of lassos took 9.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 330 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 298 IncrementalHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 148 mSDtfsCounter, 298 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital222 mio100 ax100 hnf100 lsp91 ukn54 mio100 lsp36 div100 bol100 ite100 ukn100 eq156 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:43:53,301 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-04 15:43:53,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:53,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:53,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:54,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:54,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 15:43:54,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE