/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/interleaved5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:58:33,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:58:34,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:58:34,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:58:34,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:58:34,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:58:34,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:58:34,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:58:34,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:58:34,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:58:34,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:58:34,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:58:34,050 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:58:34,051 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:58:34,051 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:58:34,051 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:58:34,052 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:58:34,052 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:58:34,052 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:58:34,052 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:58:34,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:58:34,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:58:34,052 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:58:34,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:58:34,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:58:34,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:58:34,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:58:34,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:58:34,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:58:34,053 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:58:34,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:58:34,053 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:58:34,053 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:58:34,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:58:34,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:58:34,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:34,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:58:34,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:58:34,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:58:34,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:58:34,054 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:58:34,054 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:58:34,054 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:58:34,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:58:34,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:58:34,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:58:34,255 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:58:34,255 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:58:34,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/interleaved5.c.bpl [2025-04-26 16:58:34,256 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/interleaved5.c.bpl' [2025-04-26 16:58:34,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:58:34,274 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:58:34,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:34,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:58:34,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:58:34,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:34" (1/1) ... [2025-04-26 16:58:34,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:34" (1/1) ... [2025-04-26 16:58:34,303 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:58:34,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:34,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:58:34,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:58:34,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:58:34,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:34" (1/1) ... [2025-04-26 16:58:34,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:34" (1/1) ... [2025-04-26 16:58:34,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:34" (1/1) ... [2025-04-26 16:58:34,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:34" (1/1) ... [2025-04-26 16:58:34,313 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:34" (1/1) ... [2025-04-26 16:58:34,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:34" (1/1) ... [2025-04-26 16:58:34,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:34" (1/1) ... [2025-04-26 16:58:34,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:34" (1/1) ... [2025-04-26 16:58:34,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:34" (1/1) ... [2025-04-26 16:58:34,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:58:34,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:58:34,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:58:34,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:58:34,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:34" (1/1) ... [2025-04-26 16:58:34,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:34,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:34,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:34,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:58:34,381 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:58:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:58:34,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:58:34,382 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:58:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:58:34,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:58:34,382 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:58:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:58:34,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:58:34,382 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:58:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:58:34,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:58:34,382 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:58:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:58:34,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:58:34,382 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:58:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:58:34,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:58:34,383 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:58:34,423 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:58:34,425 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:58:34,505 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:58:34,505 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:58:34,516 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:58:34,516 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:58:34,517 INFO L201 PluginConnector]: Adding new model interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:34 BoogieIcfgContainer [2025-04-26 16:58:34,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:58:34,517 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:58:34,517 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:58:34,523 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:58:34,523 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:34,523 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:34" (1/2) ... [2025-04-26 16:58:34,524 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25890448 and model type interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:58:34, skipping insertion in model container [2025-04-26 16:58:34,524 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:34,524 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:34" (2/2) ... [2025-04-26 16:58:34,525 INFO L376 chiAutomizerObserver]: Analyzing ICFG interleaved5.c.bpl [2025-04-26 16:58:34,575 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:58:34,613 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:58:34,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:58:34,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:34,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:34,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:58:34,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 139 flow [2025-04-26 16:58:34,695 INFO L116 PetriNetUnfolderBase]: 5/42 cut-off events. [2025-04-26 16:58:34,697 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:58:34,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 42 events. 5/42 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-04-26 16:58:34,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 52 transitions, 139 flow [2025-04-26 16:58:34,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 42 transitions, 114 flow [2025-04-26 16:58:34,705 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 53 places, 42 transitions, 114 flow [2025-04-26 16:58:34,711 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:58:34,887 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 891#[L95, L80-1, L71, L24]true [2025-04-26 16:58:35,077 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2813#[L65, thread4EXIT, L21, thread1EXIT, L56]true [2025-04-26 16:58:35,090 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3345#[thread5EXIT, L23, L65-1, L56, L80]true [2025-04-26 16:58:35,101 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3615#[L95, L23, L65-1, L80, L56]true [2025-04-26 16:58:35,104 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3467#[L95, L23, L71, L86, L56]true [2025-04-26 16:58:35,106 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3127#[L21, L65-1, thread1EXIT, L80, L56]true [2025-04-26 16:58:35,214 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5543#[L37, L80-1, thread2EXIT, L95, L71, L22]true [2025-04-26 16:58:35,215 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5719#[L101, L37, thread2EXIT, L86, L71, L22]true [2025-04-26 16:58:35,273 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 7083#[L50, thread3EXIT, L86, L22, L36, L101]true [2025-04-26 16:58:35,312 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8161#[L50, thread5EXIT, L65, L36, L22, thread4EXIT]true [2025-04-26 16:58:35,321 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8383#[L101, L50-1, L65, L36, L22, thread4EXIT]true [2025-04-26 16:58:35,387 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10061#[L80, thread5EXIT, L50-1, L65, L36, L22]true [2025-04-26 16:58:35,389 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9667#[L80, thread5EXIT, L71, L22, L36, L56]true [2025-04-26 16:58:35,420 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 11641#[L101, L80, L50-1, L65, L22, L36]true [2025-04-26 16:58:35,441 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 11909#[L50, L37, L86, L95, L71, L22]true [2025-04-26 16:58:35,478 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10541#[L80, L95, L22, L36, L56, L65-1]true [2025-04-26 16:58:35,492 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8697#[L21, L65-1, L36, L80, L56]true [2025-04-26 16:58:35,494 WARN L140 AmpleReduction]: Number of pruned transitions: 9873 [2025-04-26 16:58:35,494 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 17 [2025-04-26 16:58:35,494 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 609 [2025-04-26 16:58:35,495 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:68 [2025-04-26 16:58:35,495 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:3242 [2025-04-26 16:58:35,495 WARN L145 AmpleReduction]: Times succ was already a loop node:270 [2025-04-26 16:58:35,495 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:1247 [2025-04-26 16:58:35,495 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:58:35,512 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 3903 states, 3902 states have (on average 1.739364428498206) internal successors, (in total 6787), 3902 states have internal predecessors, (6787), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:35,519 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:58:35,519 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:58:35,519 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:58:35,519 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:58:35,519 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:58:35,519 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:58:35,519 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:58:35,519 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:58:35,529 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3903 states, 3902 states have (on average 1.739364428498206) internal successors, (in total 6787), 3902 states have internal predecessors, (6787), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:35,619 INFO L131 ngComponentsAnalysis]: Automaton has 289 accepting balls. 3123 [2025-04-26 16:58:35,620 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:35,620 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:35,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:35,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:35,623 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:58:35,630 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3903 states, 3902 states have (on average 1.739364428498206) internal successors, (in total 6787), 3902 states have internal predecessors, (6787), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:35,665 INFO L131 ngComponentsAnalysis]: Automaton has 289 accepting balls. 3123 [2025-04-26 16:58:35,666 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:35,666 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:35,666 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:35,666 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:35,670 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L18: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[153] L18-->L37-1: Formula: (= v_thread1Thread1of1ForFork4_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork4_thidvar0]" [2025-04-26 16:58:35,671 INFO L754 eck$LassoCheckResult]: Loop: "[110] L37-1-->L35: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[112] L35-->L36: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[113] L36-->L37: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[114] L37-->L37-1: Formula: (and (< 0 v_f1_6) (= v_f1_5 0)) InVars {f1=v_f1_6} OutVars{f1=v_f1_5} AuxVars[] AssignedVars[f1]" [2025-04-26 16:58:35,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:35,676 INFO L85 PathProgramCache]: Analyzing trace with hash 4338, now seen corresponding path program 1 times [2025-04-26 16:58:35,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:35,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845619920] [2025-04-26 16:58:35,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:35,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:35,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:35,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:35,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:35,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:35,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:35,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:35,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:35,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:35,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:35,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:35,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:35,774 INFO L85 PathProgramCache]: Analyzing trace with hash 4311780, now seen corresponding path program 1 times [2025-04-26 16:58:35,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:35,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581669113] [2025-04-26 16:58:35,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:35,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:35,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:35,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:35,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:35,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:35,785 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:35,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:35,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:35,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:35,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:35,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:35,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash -285344939, now seen corresponding path program 1 times [2025-04-26 16:58:35,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:35,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801441558] [2025-04-26 16:58:35,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:35,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:35,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:35,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:35,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:35,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:35,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:35,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801441558] [2025-04-26 16:58:35,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801441558] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:35,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:35,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:58:35,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464667041] [2025-04-26 16:58:35,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:35,991 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:35,992 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:35,992 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:35,992 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:35,992 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:35,992 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:35,992 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:35,992 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:35,993 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:35,993 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:35,993 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:36,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,066 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:36,066 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:36,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:58:36,074 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:36,074 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:36,089 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:36,089 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f2=1} Honda state: {f2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:58:36,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:36,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,098 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:58:36,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:36,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:36,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:36,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,124 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:58:36,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:36,126 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:36,195 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:36,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:36,201 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:36,201 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:36,201 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:36,201 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:36,201 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:36,201 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,201 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:36,201 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:36,201 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:36,201 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:36,201 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:36,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,253 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:36,256 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:36,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,259 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:58:36,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04-26 16:58:36,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:36,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:36,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:36,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:36,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:36,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:36,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:36,282 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:36,288 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:36,288 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:36,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,293 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:58:36,294 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:36,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:58:36,298 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:36,298 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:36,298 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 16:58:36,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:58:36,309 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:36,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:36,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:36,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:36,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:36,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:36,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:36,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:36,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:36,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:36,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:36,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:36,412 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:36,420 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 3903 states, 3902 states have (on average 1.739364428498206) internal successors, (in total 6787), 3902 states have internal predecessors, (6787), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:36,617 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 3903 states, 3902 states have (on average 1.739364428498206) internal successors, (in total 6787), 3902 states have internal predecessors, (6787), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 8149 states and 14437 transitions. Complement of second has 6 states. [2025-04-26 16:58:36,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-26 16:58:36,625 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:58:36,625 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:36,625 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:58:36,625 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:36,625 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 2 letters. Loop has 8 letters. [2025-04-26 16:58:36,626 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:36,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8149 states and 14437 transitions. [2025-04-26 16:58:36,691 INFO L131 ngComponentsAnalysis]: Automaton has 259 accepting balls. 2255 [2025-04-26 16:58:36,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8149 states to 5556 states and 9656 transitions. [2025-04-26 16:58:36,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3328 [2025-04-26 16:58:36,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3713 [2025-04-26 16:58:36,756 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5556 states and 9656 transitions. [2025-04-26 16:58:36,757 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:36,757 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5556 states and 9656 transitions. [2025-04-26 16:58:36,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5556 states and 9656 transitions. [2025-04-26 16:58:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5556 to 5257. [2025-04-26 16:58:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5257 states have (on average 1.7276012935134106) internal successors, (in total 9082), 5256 states have internal predecessors, (9082), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 9082 transitions. [2025-04-26 16:58:36,952 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5257 states and 9082 transitions. [2025-04-26 16:58:36,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:36,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:36,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:36,954 INFO L87 Difference]: Start difference. First operand 5257 states and 9082 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:37,038 INFO L93 Difference]: Finished difference Result 7185 states and 11685 transitions. [2025-04-26 16:58:37,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7185 states and 11685 transitions. [2025-04-26 16:58:37,091 INFO L131 ngComponentsAnalysis]: Automaton has 475 accepting balls. 3581 [2025-04-26 16:58:37,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7185 states to 6629 states and 10842 transitions. [2025-04-26 16:58:37,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4999 [2025-04-26 16:58:37,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5103 [2025-04-26 16:58:37,138 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6629 states and 10842 transitions. [2025-04-26 16:58:37,139 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:37,139 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6629 states and 10842 transitions. [2025-04-26 16:58:37,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6629 states and 10842 transitions. [2025-04-26 16:58:37,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6629 to 5155. [2025-04-26 16:58:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5155 states have (on average 1.6073714839961202) internal successors, (in total 8286), 5154 states have internal predecessors, (8286), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 8286 transitions. [2025-04-26 16:58:37,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5155 states and 8286 transitions. [2025-04-26 16:58:37,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:37,294 INFO L438 stractBuchiCegarLoop]: Abstraction has 5155 states and 8286 transitions. [2025-04-26 16:58:37,294 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:58:37,294 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5155 states and 8286 transitions. [2025-04-26 16:58:37,309 INFO L131 ngComponentsAnalysis]: Automaton has 284 accepting balls. 2444 [2025-04-26 16:58:37,309 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:37,309 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:37,310 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:58:37,310 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:37,310 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L18: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[153] L18-->L37-1: Formula: (= v_thread1Thread1of1ForFork4_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork4_thidvar0]" "[109] L37-1-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[111] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[141] L18-1-->L48: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 16:58:37,311 INFO L754 eck$LassoCheckResult]: Loop: "[116] L48-->L50: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[118] L50-->L50-1: Formula: (and (< 0 v_f2_6) (= v_f2_5 0)) InVars {f2=v_f2_6} OutVars{f2=v_f2_5} AuxVars[] AssignedVars[f2]" "[119] L50-1-->L56: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[120] L56-->L48: Formula: (= v_f3_1 1) InVars {} OutVars{f3=v_f3_1} AuxVars[] AssignedVars[f3]" [2025-04-26 16:58:37,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash 129341689, now seen corresponding path program 1 times [2025-04-26 16:58:37,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:37,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324122429] [2025-04-26 16:58:37,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:37,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:37,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:37,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:37,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:37,324 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:37,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:37,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:37,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:37,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:37,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:37,331 INFO L85 PathProgramCache]: Analyzing trace with hash 4496484, now seen corresponding path program 1 times [2025-04-26 16:58:37,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:37,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164482312] [2025-04-26 16:58:37,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:37,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:37,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:37,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:37,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:37,336 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:37,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:37,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:37,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:37,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:37,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:37,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1860896420, now seen corresponding path program 1 times [2025-04-26 16:58:37,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:37,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843601036] [2025-04-26 16:58:37,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:37,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:37,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:37,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:37,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:37,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:37,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843601036] [2025-04-26 16:58:37,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843601036] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:37,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:37,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:37,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998272587] [2025-04-26 16:58:37,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:37,395 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:37,396 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:37,396 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:37,396 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:37,396 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:37,396 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,396 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:37,396 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:37,396 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:37,396 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:37,396 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:37,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:37,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:37,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:37,436 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:37,436 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:37,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:37,438 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:37,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:58:37,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:37,441 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:37,452 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:37,452 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f3=1} Honda state: {f3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:58:37,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:37,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:37,460 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:37,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:58:37,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:37,462 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:37,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:37,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:37,480 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:37,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:58:37,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:37,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:37,506 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:37,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:37,512 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:37,512 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:37,512 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:37,512 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:37,512 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:37,512 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,512 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:37,512 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:37,512 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:37,512 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:37,512 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:37,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:37,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:37,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:37,556 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:37,556 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:37,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:37,560 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:37,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:58:37,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04-26 16:58:37,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:37,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:37,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:37,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:37,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:37,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:37,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:37,575 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:37,578 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:37,579 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:37,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:37,581 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:37,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:58:37,583 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:37,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:37,587 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:37,587 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:37,588 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f2) = 1*f2 Supporting invariants [] [2025-04-26 16:58:37,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:58:37,595 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:37,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:37,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:37,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:37,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:37,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:37,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:37,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:37,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:37,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:37,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:37,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:37,649 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-04-26 16:58:37,649 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5155 states and 8286 transitions. cyclomatic complexity: 3463 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:37,788 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5155 states and 8286 transitions. cyclomatic complexity: 3463. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 14392 states and 23133 transitions. Complement of second has 5 states. [2025-04-26 16:58:37,789 INFO L140 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-04-26 16:58:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-26 16:58:37,790 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:58:37,790 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:37,790 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:58:37,790 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:37,790 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:58:37,790 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:37,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14392 states and 23133 transitions. [2025-04-26 16:58:37,884 INFO L131 ngComponentsAnalysis]: Automaton has 464 accepting balls. 3464 [2025-04-26 16:58:37,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14392 states to 12201 states and 19571 transitions. [2025-04-26 16:58:37,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6034 [2025-04-26 16:58:37,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6451 [2025-04-26 16:58:37,966 INFO L74 IsDeterministic]: Start isDeterministic. Operand 12201 states and 19571 transitions. [2025-04-26 16:58:37,966 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:37,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12201 states and 19571 transitions. [2025-04-26 16:58:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12201 states and 19571 transitions. [2025-04-26 16:58:38,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12201 to 10331. [2025-04-26 16:58:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10331 states, 10331 states have (on average 1.621914625883264) internal successors, (in total 16756), 10330 states have internal predecessors, (16756), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10331 states to 10331 states and 16756 transitions. [2025-04-26 16:58:38,168 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10331 states and 16756 transitions. [2025-04-26 16:58:38,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:38,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:38,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:38,168 INFO L87 Difference]: Start difference. First operand 10331 states and 16756 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:38,248 INFO L93 Difference]: Finished difference Result 12709 states and 19262 transitions. [2025-04-26 16:58:38,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12709 states and 19262 transitions. [2025-04-26 16:58:38,344 INFO L131 ngComponentsAnalysis]: Automaton has 451 accepting balls. 2769 [2025-04-26 16:58:38,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12709 states to 10117 states and 15528 transitions. [2025-04-26 16:58:38,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5912 [2025-04-26 16:58:38,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6081 [2025-04-26 16:58:38,389 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10117 states and 15528 transitions. [2025-04-26 16:58:38,389 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:38,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10117 states and 15528 transitions. [2025-04-26 16:58:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states and 15528 transitions. [2025-04-26 16:58:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 6181. [2025-04-26 16:58:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6181 states, 6181 states have (on average 1.551690664940948) internal successors, (in total 9591), 6180 states have internal predecessors, (9591), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6181 states to 6181 states and 9591 transitions. [2025-04-26 16:58:38,497 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6181 states and 9591 transitions. [2025-04-26 16:58:38,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:38,498 INFO L438 stractBuchiCegarLoop]: Abstraction has 6181 states and 9591 transitions. [2025-04-26 16:58:38,498 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:58:38,498 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6181 states and 9591 transitions. [2025-04-26 16:58:38,510 INFO L131 ngComponentsAnalysis]: Automaton has 246 accepting balls. 1531 [2025-04-26 16:58:38,511 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:38,511 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:38,511 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:38,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:38,511 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L18: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[153] L18-->L37-1: Formula: (= v_thread1Thread1of1ForFork4_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork4_thidvar0]" "[109] L37-1-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[111] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[141] L18-1-->L48: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[115] L48-->thread2FINAL: Formula: (<= v_z_3 v_x2_1) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[117] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[144] L19-->L63: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" [2025-04-26 16:58:38,511 INFO L754 eck$LassoCheckResult]: Loop: "[122] L63-->L65: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[124] L65-->L65-1: Formula: (and (< 0 v_f3_6) (= v_f3_5 0)) InVars {f3=v_f3_6} OutVars{f3=v_f3_5} AuxVars[] AssignedVars[f3]" "[125] L65-1-->L71: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[126] L71-->L63: Formula: (= v_f4_1 1) InVars {} OutVars{f4=v_f4_1} AuxVars[] AssignedVars[f4]" [2025-04-26 16:58:38,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash 632706773, now seen corresponding path program 1 times [2025-04-26 16:58:38,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:38,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090164856] [2025-04-26 16:58:38,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:38,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:38,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:38,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:38,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:38,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:38,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:38,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:38,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:38,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:38,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:38,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:38,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:38,522 INFO L85 PathProgramCache]: Analyzing trace with hash 4681188, now seen corresponding path program 1 times [2025-04-26 16:58:38,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:38,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467770947] [2025-04-26 16:58:38,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:38,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:38,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:38,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:38,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:38,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:38,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:38,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:38,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:38,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:38,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:38,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:38,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:38,531 INFO L85 PathProgramCache]: Analyzing trace with hash 579746488, now seen corresponding path program 1 times [2025-04-26 16:58:38,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:38,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815818603] [2025-04-26 16:58:38,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:38,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:38,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:38,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:38,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:38,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:38,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:38,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815818603] [2025-04-26 16:58:38,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815818603] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:38,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:38,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:38,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303000051] [2025-04-26 16:58:38,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:38,590 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:38,590 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:38,590 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:38,590 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:38,590 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:38,590 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:38,590 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:38,590 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:38,590 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:38,590 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:38,590 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:38,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:38,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:38,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:38,632 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:38,632 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:38,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:38,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:38,635 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:38,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:58:38,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:38,637 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:38,648 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:38,648 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f4=1} Honda state: {f4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:58:38,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:38,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:38,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:38,655 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:38,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:58:38,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:38,658 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:38,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:38,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:38,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:38,676 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:38,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:58:38,679 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:38,679 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:38,701 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:38,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:38,706 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:38,706 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:38,706 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:38,706 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:38,706 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:38,706 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:38,706 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:38,706 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:38,706 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:38,706 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:38,706 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:38,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:38,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:38,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:38,747 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:38,747 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:38,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:38,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:38,749 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:38,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:58:38,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04-26 16:58:38,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:38,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:38,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:38,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:38,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:38,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:38,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:38,764 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:58:38,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:38,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:38,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:38,771 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:38,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:58:38,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-04-26 16:58:38,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:38,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:38,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:38,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:38,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:38,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:38,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:38,787 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:38,790 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:38,790 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:38,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:38,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:38,791 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:38,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:58:38,794 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:38,796 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:38,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:38,798 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:38,798 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:38,798 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f3) = 1*f3 Supporting invariants [] [2025-04-26 16:58:38,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:38,804 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:38,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:38,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:38,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:38,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:38,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:38,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:38,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:38,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:38,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:38,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:38,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:38,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:38,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:38,853 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-04-26 16:58:38,854 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6181 states and 9591 transitions. cyclomatic complexity: 3745 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:38,965 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6181 states and 9591 transitions. cyclomatic complexity: 3745. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 13943 states and 21342 transitions. Complement of second has 5 states. [2025-04-26 16:58:38,966 INFO L140 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-04-26 16:58:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-04-26 16:58:38,967 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:58:38,967 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:38,967 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:58:38,967 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:38,967 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 8 letters. Loop has 8 letters. [2025-04-26 16:58:38,967 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:38,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13943 states and 21342 transitions. [2025-04-26 16:58:39,026 INFO L131 ngComponentsAnalysis]: Automaton has 348 accepting balls. 2003 [2025-04-26 16:58:39,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13943 states to 12356 states and 19018 transitions. [2025-04-26 16:58:39,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5544 [2025-04-26 16:58:39,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5806 [2025-04-26 16:58:39,087 INFO L74 IsDeterministic]: Start isDeterministic. Operand 12356 states and 19018 transitions. [2025-04-26 16:58:39,087 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:39,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12356 states and 19018 transitions. [2025-04-26 16:58:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12356 states and 19018 transitions. [2025-04-26 16:58:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12356 to 11221. [2025-04-26 16:58:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11221 states, 11221 states have (on average 1.5554763390072186) internal successors, (in total 17454), 11220 states have internal predecessors, (17454), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11221 states to 11221 states and 17454 transitions. [2025-04-26 16:58:39,365 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11221 states and 17454 transitions. [2025-04-26 16:58:39,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:39,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:39,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:39,365 INFO L87 Difference]: Start difference. First operand 11221 states and 17454 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:39,458 INFO L93 Difference]: Finished difference Result 13446 states and 19980 transitions. [2025-04-26 16:58:39,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13446 states and 19980 transitions. [2025-04-26 16:58:39,509 INFO L131 ngComponentsAnalysis]: Automaton has 328 accepting balls. 1572 [2025-04-26 16:58:39,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13446 states to 10198 states and 15383 transitions. [2025-04-26 16:58:39,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5711 [2025-04-26 16:58:39,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5886 [2025-04-26 16:58:39,552 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10198 states and 15383 transitions. [2025-04-26 16:58:39,552 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:39,552 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10198 states and 15383 transitions. [2025-04-26 16:58:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10198 states and 15383 transitions. [2025-04-26 16:58:39,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10198 to 7039. [2025-04-26 16:58:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7039 states, 7039 states have (on average 1.5294786191220344) internal successors, (in total 10766), 7038 states have internal predecessors, (10766), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7039 states to 7039 states and 10766 transitions. [2025-04-26 16:58:39,770 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7039 states and 10766 transitions. [2025-04-26 16:58:39,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:39,774 INFO L438 stractBuchiCegarLoop]: Abstraction has 7039 states and 10766 transitions. [2025-04-26 16:58:39,775 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:58:39,775 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7039 states and 10766 transitions. [2025-04-26 16:58:39,836 INFO L131 ngComponentsAnalysis]: Automaton has 189 accepting balls. 915 [2025-04-26 16:58:39,836 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:39,836 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:39,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:39,842 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:39,843 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L18: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[153] L18-->L37-1: Formula: (= v_thread1Thread1of1ForFork4_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork4_thidvar0]" "[110] L37-1-->L35: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[112] L35-->L36: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[113] L36-->L37: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[141] L18-1-->L48: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[116] L48-->L50: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[144] L19-->L63: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[122] L63-->L65: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[147] L20-->L78: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" [2025-04-26 16:58:39,843 INFO L754 eck$LassoCheckResult]: Loop: "[128] L78-->L80: Formula: (< v_x4_3 v_z_8) InVars {x4=v_x4_3, z=v_z_8} OutVars{x4=v_x4_3, z=v_z_8} AuxVars[] AssignedVars[]" "[130] L80-->L80-1: Formula: (and (< 0 v_f4_6) (= v_f4_5 0)) InVars {f4=v_f4_6} OutVars{f4=v_f4_5} AuxVars[] AssignedVars[f4]" "[131] L80-1-->L86: Formula: (= v_x4_4 (+ v_x4_5 1)) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" "[132] L86-->L78: Formula: (= v_f5_2 1) InVars {} OutVars{f5=v_f5_2} AuxVars[] AssignedVars[f5]" [2025-04-26 16:58:39,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1463707, now seen corresponding path program 1 times [2025-04-26 16:58:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:39,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652389751] [2025-04-26 16:58:39,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:39,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:39,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:39,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:39,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:39,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:39,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:39,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:39,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:39,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:39,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:39,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:39,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash 4865892, now seen corresponding path program 1 times [2025-04-26 16:58:39,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:39,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713698605] [2025-04-26 16:58:39,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:39,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:39,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:39,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:39,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:39,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:39,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:39,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:39,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:39,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:39,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:39,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:39,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:39,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1154488264, now seen corresponding path program 1 times [2025-04-26 16:58:39,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:39,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657871351] [2025-04-26 16:58:39,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:39,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:39,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:58:39,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:58:39,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:39,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:39,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:39,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657871351] [2025-04-26 16:58:39,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657871351] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:39,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:39,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:39,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240023550] [2025-04-26 16:58:39,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:40,002 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:40,002 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:40,002 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:40,002 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:40,002 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:40,003 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:40,003 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:40,003 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:40,003 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:40,003 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:40,003 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:40,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:40,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:40,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:40,040 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:40,041 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:40,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:40,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:40,044 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:40,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:58:40,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:40,047 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:40,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:58:40,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:40,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:40,067 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:40,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:58:40,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:40,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:40,135 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:40,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:58:40,140 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:40,140 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:40,140 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:40,140 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:40,140 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:40,140 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:40,140 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:40,140 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:40,140 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:40,140 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:40,140 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:40,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:40,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:40,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:40,198 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:40,198 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:40,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:40,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:40,201 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:40,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:58:40,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:40,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:40,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:40,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:40,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:40,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:40,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:40,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:40,217 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:40,220 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:40,220 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:40,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:40,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:40,222 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:40,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:58:40,225 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:40,228 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:40,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:40,229 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:40,229 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:40,229 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:58:40,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:58:40,236 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:40,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:40,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:40,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:40,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:40,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:40,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:40,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:40,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:40,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:40,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:40,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:40,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:40,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:40,319 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:40,319 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7039 states and 10766 transitions. cyclomatic complexity: 3993 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:40,451 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7039 states and 10766 transitions. cyclomatic complexity: 3993. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 14732 states and 23164 transitions. Complement of second has 6 states. [2025-04-26 16:58:40,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-26 16:58:40,454 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:58:40,454 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:40,454 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:58:40,454 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:40,454 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 10 letters. Loop has 8 letters. [2025-04-26 16:58:40,454 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:40,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14732 states and 23164 transitions. [2025-04-26 16:58:40,528 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 396 [2025-04-26 16:58:40,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14732 states to 9196 states and 14864 transitions. [2025-04-26 16:58:40,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2598 [2025-04-26 16:58:40,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2892 [2025-04-26 16:58:40,567 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9196 states and 14864 transitions. [2025-04-26 16:58:40,567 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:40,568 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9196 states and 14864 transitions. [2025-04-26 16:58:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9196 states and 14864 transitions. [2025-04-26 16:58:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9196 to 8789. [2025-04-26 16:58:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8789 states, 8789 states have (on average 1.6199795198543634) internal successors, (in total 14238), 8788 states have internal predecessors, (14238), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8789 states to 8789 states and 14238 transitions. [2025-04-26 16:58:40,759 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8789 states and 14238 transitions. [2025-04-26 16:58:40,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:40,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:40,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:40,760 INFO L87 Difference]: Start difference. First operand 8789 states and 14238 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:40,828 INFO L93 Difference]: Finished difference Result 11850 states and 18555 transitions. [2025-04-26 16:58:40,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11850 states and 18555 transitions. [2025-04-26 16:58:40,877 INFO L131 ngComponentsAnalysis]: Automaton has 175 accepting balls. 700 [2025-04-26 16:58:40,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11850 states to 11506 states and 17953 transitions. [2025-04-26 16:58:40,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3553 [2025-04-26 16:58:40,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4004 [2025-04-26 16:58:40,922 INFO L74 IsDeterministic]: Start isDeterministic. Operand 11506 states and 17953 transitions. [2025-04-26 16:58:40,922 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:40,922 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11506 states and 17953 transitions. [2025-04-26 16:58:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11506 states and 17953 transitions. [2025-04-26 16:58:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11506 to 9305. [2025-04-26 16:58:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9305 states, 9305 states have (on average 1.5767866738312735) internal successors, (in total 14672), 9304 states have internal predecessors, (14672), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9305 states to 9305 states and 14672 transitions. [2025-04-26 16:58:41,046 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9305 states and 14672 transitions. [2025-04-26 16:58:41,047 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:41,047 INFO L438 stractBuchiCegarLoop]: Abstraction has 9305 states and 14672 transitions. [2025-04-26 16:58:41,047 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:58:41,047 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9305 states and 14672 transitions. [2025-04-26 16:58:41,070 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 396 [2025-04-26 16:58:41,070 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:41,070 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:41,071 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:41,071 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:41,071 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L18: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[153] L18-->L37-1: Formula: (= v_thread1Thread1of1ForFork4_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork4_thidvar0]" "[110] L37-1-->L35: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[112] L35-->L36: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[113] L36-->L37: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[141] L18-1-->L48: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[116] L48-->L50: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[144] L19-->L63: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[122] L63-->L65: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[147] L20-->L78: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" "[128] L78-->L80: Formula: (< v_x4_3 v_z_8) InVars {x4=v_x4_3, z=v_z_8} OutVars{x4=v_x4_3, z=v_z_8} AuxVars[] AssignedVars[]" "[150] L21-->L93: Formula: (and (= v_thread5Thread1of1ForFork3_thidvar1_2 5) (= v_thread5Thread1of1ForFork3_thidvar3_2 5) (= v_thread5Thread1of1ForFork3_thidvar4_2 5) (= v_thread5Thread1of1ForFork3_thidvar2_2 5) (= v_thread5Thread1of1ForFork3_thidvar0_2 5)) InVars {} OutVars{thread5Thread1of1ForFork3_thidvar2=v_thread5Thread1of1ForFork3_thidvar2_2, thread5Thread1of1ForFork3_thidvar1=v_thread5Thread1of1ForFork3_thidvar1_2, thread5Thread1of1ForFork3_thidvar4=v_thread5Thread1of1ForFork3_thidvar4_2, thread5Thread1of1ForFork3_thidvar3=v_thread5Thread1of1ForFork3_thidvar3_2, thread5Thread1of1ForFork3_thidvar0=v_thread5Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork3_thidvar2, thread5Thread1of1ForFork3_thidvar1, thread5Thread1of1ForFork3_thidvar4, thread5Thread1of1ForFork3_thidvar3, thread5Thread1of1ForFork3_thidvar0]" [2025-04-26 16:58:41,071 INFO L754 eck$LassoCheckResult]: Loop: "[134] L93-->L95: Formula: (< v_x5_2 v_z_9) InVars {x5=v_x5_2, z=v_z_9} OutVars{x5=v_x5_2, z=v_z_9} AuxVars[] AssignedVars[]" "[136] L95-->L95-1: Formula: (and (= v_f5_5 0) (< 0 v_f5_6)) InVars {f5=v_f5_6} OutVars{f5=v_f5_5} AuxVars[] AssignedVars[f5]" "[137] L95-1-->L101: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" "[138] L101-->L93: Formula: (= v_f1_4 1) InVars {} OutVars{f1=v_f1_4} AuxVars[] AssignedVars[f1]" [2025-04-26 16:58:41,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:41,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1406618309, now seen corresponding path program 1 times [2025-04-26 16:58:41,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:41,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88812576] [2025-04-26 16:58:41,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:41,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:41,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:41,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:41,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:41,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:41,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:41,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:41,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:41,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:41,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:41,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:41,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:41,086 INFO L85 PathProgramCache]: Analyzing trace with hash 5050596, now seen corresponding path program 1 times [2025-04-26 16:58:41,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:41,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695567264] [2025-04-26 16:58:41,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:41,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:41,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:41,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:41,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:41,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:41,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:41,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:41,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:41,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:41,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:41,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:41,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:41,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1380227358, now seen corresponding path program 1 times [2025-04-26 16:58:41,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:41,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016151957] [2025-04-26 16:58:41,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:41,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:41,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:58:41,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:58:41,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:41,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:41,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:41,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016151957] [2025-04-26 16:58:41,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016151957] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:41,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:41,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:41,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931004465] [2025-04-26 16:58:41,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:41,152 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:41,152 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:41,152 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:41,152 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:41,152 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:41,152 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:41,152 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:41,152 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:41,152 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:41,152 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:41,152 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:41,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:41,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:41,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:41,192 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:41,193 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:41,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:41,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:41,197 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:41,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:58:41,200 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:41,200 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:41,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:41,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:41,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:41,217 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:41,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:58:41,219 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:41,219 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:41,284 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:41,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:41,289 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:41,289 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:41,289 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:41,289 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:41,289 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:41,289 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:41,289 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:41,289 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:41,289 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:41,289 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:41,289 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:41,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:41,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:41,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:41,323 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:41,323 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:41,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:41,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:41,326 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:41,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:58:41,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04-26 16:58:41,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:41,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:41,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:41,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:41,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:41,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:41,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:41,343 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:41,345 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:41,345 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:41,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:41,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:41,347 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:41,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:58:41,350 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:41,352 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:41,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:41,353 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:41,353 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:41,353 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 16:58:41,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:58:41,359 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:41,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:41,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:41,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:41,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:41,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:41,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:41,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:41,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:41,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:41,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:41,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:41,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:41,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:41,495 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:41,495 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9305 states and 14672 transitions. cyclomatic complexity: 5573 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:41,625 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9305 states and 14672 transitions. cyclomatic complexity: 5573. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 18986 states and 30663 transitions. Complement of second has 6 states. [2025-04-26 16:58:41,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-04-26 16:58:41,627 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:58:41,627 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:41,627 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 16 letters. Loop has 4 letters. [2025-04-26 16:58:41,627 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:41,627 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 12 letters. Loop has 8 letters. [2025-04-26 16:58:41,627 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:41,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18986 states and 30663 transitions. [2025-04-26 16:58:41,703 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:41,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18986 states to 0 states and 0 transitions. [2025-04-26 16:58:41,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:58:41,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:58:41,704 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:58:41,704 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:58:41,704 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:41,704 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:41,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:41,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:41,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:41,704 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:41,704 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:58:41,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:58:41,705 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:41,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:58:41,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:58:41,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:58:41,705 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:58:41,705 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:58:41,705 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:41,705 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:41,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:58:41,705 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:41,706 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:58:41,706 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:58:41,706 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:41,706 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:58:41,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:41,719 INFO L201 PluginConnector]: Adding new model interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:58:41 BoogieIcfgContainer [2025-04-26 16:58:41,719 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:58:41,720 INFO L158 Benchmark]: Toolchain (without parser) took 7445.72ms. Allocated memory was 159.4MB in the beginning and 629.1MB in the end (delta: 469.8MB). Free memory was 86.0MB in the beginning and 307.7MB in the end (delta: -221.7MB). Peak memory consumption was 249.1MB. Max. memory is 8.0GB. [2025-04-26 16:58:41,720 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:41,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.59ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:41,720 INFO L158 Benchmark]: Boogie Preprocessor took 28.69ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:58:41,721 INFO L158 Benchmark]: RCFGBuilder took 183.16ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 72.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:58:41,721 INFO L158 Benchmark]: BuchiAutomizer took 7201.92ms. Allocated memory was 159.4MB in the beginning and 629.1MB in the end (delta: 469.8MB). Free memory was 72.4MB in the beginning and 307.7MB in the end (delta: -235.3MB). Peak memory consumption was 236.5MB. Max. memory is 8.0GB. [2025-04-26 16:58:41,724 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.59ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.69ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 183.16ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 72.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 7201.92ms. Allocated memory was 159.4MB in the beginning and 629.1MB in the end (delta: 469.8MB). Free memory was 72.4MB in the beginning and 307.7MB in the end (delta: -235.3MB). Peak memory consumption was 236.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.2s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 1.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 14481 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.9s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 501 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 234 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 385 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 267 mSDtfsCounter, 385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT5 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp57 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 41ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.9s InitialAbstraction: Time to compute Ample Reduction [ms]: 886, Number of transitions in reduction automaton: 6787, Number of states in reduction automaton: 3903, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (5 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function f2 and consists of 3 locations. One deterministic module has affine ranking function f3 and consists of 3 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:58:41,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...