/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 ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:09,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:09,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:09,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:09,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:09,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:09,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:09,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:09,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:09,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:09,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:09,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:09,989 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:09,989 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:09,989 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:09,990 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:09,990 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:09,990 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:09,990 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:09,990 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:09,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:09,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:09,990 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:09,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:09,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:09,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:09,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:09,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:09,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:09,990 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:09,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:09,991 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:09,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:09,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:09,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:09,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:09,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:09,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:09,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:09,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:09,991 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:09,991 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:09,991 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:10,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:10,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:10,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:10,221 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:10,221 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:10,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-3.wvr.bpl [2025-04-26 16:56:10,222 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-3.wvr.bpl' [2025-04-26 16:56:10,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:10,243 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:10,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:10,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:10,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:10,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,279 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:10,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:10,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:10,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:10,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:10,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:10,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:10,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:10,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:10,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:10,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,331 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:56:10,337 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:56:10,355 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:10,356 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:10,356 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:10,356 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:56:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:56:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:56:10,357 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:56:10,398 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:10,400 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:10,494 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:10,494 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:10,510 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:10,510 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:10,511 INFO L201 PluginConnector]: Adding new model queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:10 BoogieIcfgContainer [2025-04-26 16:56:10,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:10,511 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:10,511 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:10,517 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:10,517 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:10,517 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/2) ... [2025-04-26 16:56:10,519 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ee4ed4e and model type queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:10, skipping insertion in model container [2025-04-26 16:56:10,519 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:10,519 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:10" (2/2) ... [2025-04-26 16:56:10,522 INFO L376 chiAutomizerObserver]: Analyzing ICFG queue-add-3.wvr.bpl [2025-04-26 16:56:10,569 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:56:10,600 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:10,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:10,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,605 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:56:10,606 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:56:10,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 103 flow [2025-04-26 16:56:10,681 INFO L116 PetriNetUnfolderBase]: 3/35 cut-off events. [2025-04-26 16:56:10,683 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:56:10,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 3/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-04-26 16:56:10,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 41 transitions, 103 flow [2025-04-26 16:56:10,692 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 35 transitions, 88 flow [2025-04-26 16:56:10,692 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 42 places, 35 transitions, 88 flow [2025-04-26 16:56:10,698 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:10,901 WARN L140 AmpleReduction]: Number of pruned transitions: 629 [2025-04-26 16:56:10,901 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:10,901 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 92 [2025-04-26 16:56:10,901 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:27 [2025-04-26 16:56:10,901 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:338 [2025-04-26 16:56:10,902 WARN L145 AmpleReduction]: Times succ was already a loop node:28 [2025-04-26 16:56:10,902 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:128 [2025-04-26 16:56:10,902 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:10,907 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 458 states, 456 states have (on average 1.594298245614035) internal successors, (in total 727), 457 states have internal predecessors, (727), 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:56:10,915 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:10,915 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:10,915 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:10,915 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:10,915 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:10,915 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:10,915 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:10,915 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:10,917 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 458 states, 456 states have (on average 1.594298245614035) internal successors, (in total 727), 457 states have internal predecessors, (727), 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:56:10,968 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 338 [2025-04-26 16:56:10,968 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:10,968 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:10,975 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:10,976 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:10,976 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:10,977 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 458 states, 456 states have (on average 1.594298245614035) internal successors, (in total 727), 457 states have internal predecessors, (727), 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:56:10,986 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 338 [2025-04-26 16:56:10,986 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:10,986 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:10,986 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:10,986 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:10,993 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" [2025-04-26 16:56:10,993 INFO L754 eck$LassoCheckResult]: Loop: "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" [2025-04-26 16:56:11,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,001 INFO L85 PathProgramCache]: Analyzing trace with hash 123135, now seen corresponding path program 1 times [2025-04-26 16:56:11,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011382684] [2025-04-26 16:56:11,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,055 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,078 INFO L85 PathProgramCache]: Analyzing trace with hash 127171, now seen corresponding path program 1 times [2025-04-26 16:56:11,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139003881] [2025-04-26 16:56:11,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,099 INFO L85 PathProgramCache]: Analyzing trace with hash -626555131, now seen corresponding path program 1 times [2025-04-26 16:56:11,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173350649] [2025-04-26 16:56:11,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:11,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:11,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,106 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:11,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:11,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,234 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:11,235 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:11,235 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:11,235 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:11,235 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:11,235 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,235 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:11,235 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:11,235 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:56:11,235 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:11,235 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:11,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,405 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:11,408 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:11,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,411 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:56:11,413 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:56:11,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:11,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:11,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:11,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:11,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:11,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:11,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:11,441 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:11,460 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:56:11,460 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:56:11,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,463 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:56:11,465 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:56:11,466 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:11,485 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:56:11,486 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:11,486 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:11,487 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:56:11,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:56:11,497 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:11,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:11,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:11,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:11,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:11,561 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:56:11,575 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:56:11,577 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 458 states, 456 states have (on average 1.594298245614035) internal successors, (in total 727), 457 states have internal predecessors, (727), 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 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 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:56:11,675 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 458 states, 456 states have (on average 1.594298245614035) internal successors, (in total 727), 457 states have internal predecessors, (727), 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 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 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 1045 states and 1797 transitions. Complement of second has 7 states. [2025-04-26 16:56:11,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 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:56:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-04-26 16:56:11,683 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:56:11,684 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,684 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:56:11,684 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,684 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:56:11,684 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1045 states and 1797 transitions. [2025-04-26 16:56:11,699 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 151 [2025-04-26 16:56:11,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1045 states to 587 states and 969 transitions. [2025-04-26 16:56:11,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2025-04-26 16:56:11,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 359 [2025-04-26 16:56:11,713 INFO L74 IsDeterministic]: Start isDeterministic. Operand 587 states and 969 transitions. [2025-04-26 16:56:11,713 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:11,713 INFO L218 hiAutomatonCegarLoop]: Abstraction has 587 states and 969 transitions. [2025-04-26 16:56:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states and 969 transitions. [2025-04-26 16:56:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 515. [2025-04-26 16:56:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 515 states have (on average 1.6932038834951457) internal successors, (in total 872), 514 states have internal predecessors, (872), 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:56:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 872 transitions. [2025-04-26 16:56:11,745 INFO L240 hiAutomatonCegarLoop]: Abstraction has 515 states and 872 transitions. [2025-04-26 16:56:11,745 INFO L438 stractBuchiCegarLoop]: Abstraction has 515 states and 872 transitions. [2025-04-26 16:56:11,745 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:11,745 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 515 states and 872 transitions. [2025-04-26 16:56:11,747 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 151 [2025-04-26 16:56:11,747 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:11,747 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:11,747 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:11,747 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:11,747 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" [2025-04-26 16:56:11,748 INFO L754 eck$LassoCheckResult]: Loop: "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" [2025-04-26 16:56:11,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash 194504637, now seen corresponding path program 1 times [2025-04-26 16:56:11,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645028217] [2025-04-26 16:56:11,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:11,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:11,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,753 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:11,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:11,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,762 INFO L85 PathProgramCache]: Analyzing trace with hash 129848075, now seen corresponding path program 1 times [2025-04-26 16:56:11,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915483271] [2025-04-26 16:56:11,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:11,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:11,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,767 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:11,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:11,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash 315416783, now seen corresponding path program 1 times [2025-04-26 16:56:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019247061] [2025-04-26 16:56:11,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:56:11,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:11,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,781 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:56:11,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:11,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,948 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:11,948 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:11,948 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:11,948 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:11,948 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:11,948 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,948 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:11,948 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:11,948 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:56:11,948 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:11,948 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:11,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,202 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:12,202 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:12,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,204 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:56:12,206 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:56:12,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:12,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,226 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:12,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:56:12,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,234 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:56:12,236 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:56:12,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:12,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,256 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:12,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:12,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,265 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:56:12,267 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:56:12,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:12,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,287 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:12,292 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:56:12,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,294 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:56:12,295 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:56:12,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:12,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,306 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:56:12,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,331 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:56:12,331 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:56:12,379 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:12,386 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:56:12,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,389 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:56:12,390 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:56:12,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:12,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,407 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:12,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:56:12,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,416 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:56:12,419 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:56:12,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:12,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,437 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:12,444 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:56:12,444 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:56:12,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,461 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:56:12,462 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:56:12,463 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:12,479 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:56:12,479 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:12,479 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:12,479 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:56:12,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:56:12,486 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:12,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:12,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:12,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:12,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:12,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:12,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:12,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:12,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:12,564 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:56:12,565 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:56:12,565 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 515 states and 872 transitions. cyclomatic complexity: 397 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:56:12,607 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 515 states and 872 transitions. cyclomatic complexity: 397. 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 1058 states and 1696 transitions. Complement of second has 5 states. [2025-04-26 16:56:12,608 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:56:12,608 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:56:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-26 16:56:12,608 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 9 letters. Loop has 5 letters. [2025-04-26 16:56:12,609 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,609 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 14 letters. Loop has 5 letters. [2025-04-26 16:56:12,609 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,609 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 9 letters. Loop has 10 letters. [2025-04-26 16:56:12,609 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1058 states and 1696 transitions. [2025-04-26 16:56:12,615 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 179 [2025-04-26 16:56:12,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1058 states to 845 states and 1378 transitions. [2025-04-26 16:56:12,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 411 [2025-04-26 16:56:12,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 452 [2025-04-26 16:56:12,620 INFO L74 IsDeterministic]: Start isDeterministic. Operand 845 states and 1378 transitions. [2025-04-26 16:56:12,620 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:12,620 INFO L218 hiAutomatonCegarLoop]: Abstraction has 845 states and 1378 transitions. [2025-04-26 16:56:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states and 1378 transitions. [2025-04-26 16:56:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 700. [2025-04-26 16:56:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 700 states have (on average 1.69) internal successors, (in total 1183), 699 states have internal predecessors, (1183), 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:56:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1183 transitions. [2025-04-26 16:56:12,635 INFO L240 hiAutomatonCegarLoop]: Abstraction has 700 states and 1183 transitions. [2025-04-26 16:56:12,635 INFO L438 stractBuchiCegarLoop]: Abstraction has 700 states and 1183 transitions. [2025-04-26 16:56:12,635 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:12,635 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 700 states and 1183 transitions. [2025-04-26 16:56:12,638 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 151 [2025-04-26 16:56:12,638 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:12,638 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:12,638 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:12,638 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:12,638 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[105] L46-1-->thread2FINAL: Formula: (not v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[107] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" [2025-04-26 16:56:12,639 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 16:56:12,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,639 INFO L85 PathProgramCache]: Analyzing trace with hash 314476028, now seen corresponding path program 1 times [2025-04-26 16:56:12,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793039474] [2025-04-26 16:56:12,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:12,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:56:12,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:12,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,670 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:56:12,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:12,670 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793039474] [2025-04-26 16:56:12,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793039474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:12,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:12,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:12,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845920844] [2025-04-26 16:56:12,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:12,674 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:12,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 1 times [2025-04-26 16:56:12,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616918610] [2025-04-26 16:56:12,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:12,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:12,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:12,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,677 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:12,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:12,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:12,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:12,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:12,744 INFO L87 Difference]: Start difference. First operand 700 states and 1183 transitions. cyclomatic complexity: 531 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 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:56:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:12,774 INFO L93 Difference]: Finished difference Result 772 states and 1310 transitions. [2025-04-26 16:56:12,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 772 states and 1310 transitions. [2025-04-26 16:56:12,779 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 151 [2025-04-26 16:56:12,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 772 states to 767 states and 1305 transitions. [2025-04-26 16:56:12,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 378 [2025-04-26 16:56:12,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 378 [2025-04-26 16:56:12,783 INFO L74 IsDeterministic]: Start isDeterministic. Operand 767 states and 1305 transitions. [2025-04-26 16:56:12,783 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:12,783 INFO L218 hiAutomatonCegarLoop]: Abstraction has 767 states and 1305 transitions. [2025-04-26 16:56:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states and 1305 transitions. [2025-04-26 16:56:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 746. [2025-04-26 16:56:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 746 states have (on average 1.695710455764075) internal successors, (in total 1265), 745 states have internal predecessors, (1265), 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:56:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1265 transitions. [2025-04-26 16:56:12,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 746 states and 1265 transitions. [2025-04-26 16:56:12,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:12,796 INFO L438 stractBuchiCegarLoop]: Abstraction has 746 states and 1265 transitions. [2025-04-26 16:56:12,797 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:12,797 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 746 states and 1265 transitions. [2025-04-26 16:56:12,799 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 151 [2025-04-26 16:56:12,799 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:12,799 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:12,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:12,800 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:12,800 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 16:56:12,800 INFO L754 eck$LassoCheckResult]: Loop: "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 16:56:12,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2091824574, now seen corresponding path program 1 times [2025-04-26 16:56:12,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732688028] [2025-04-26 16:56:12,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:12,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:56:12,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:12,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,808 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:56:12,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:12,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,819 INFO L85 PathProgramCache]: Analyzing trace with hash 131725895, now seen corresponding path program 2 times [2025-04-26 16:56:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492382543] [2025-04-26 16:56:12,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:12,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:12,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:12,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:12,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,823 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:12,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:12,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1531842394, now seen corresponding path program 1 times [2025-04-26 16:56:12,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539398238] [2025-04-26 16:56:12,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:12,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:56:12,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:12,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:56:12,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:12,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,018 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:13,019 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:13,019 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:13,019 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:13,019 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:13,019 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,019 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:13,019 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:13,019 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:56:13,019 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:13,019 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:13,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,202 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:13,202 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:13,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,204 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:56:13,206 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:56:13,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:13,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,222 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:13,227 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:56:13,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,230 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:56:13,231 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:56:13,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:13,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,249 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:13,261 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:56:13,261 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:56:13,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,264 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:56:13,265 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:56:13,266 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:13,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:56:13,282 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:13,282 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:13,283 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:56:13,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:56:13,296 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:56:13,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:56:13,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:13,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:13,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:13,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:13,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:13,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:13,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:13,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:13,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:13,371 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:56:13,371 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:56:13,371 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 746 states and 1265 transitions. cyclomatic complexity: 570 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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:56:13,406 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 746 states and 1265 transitions. cyclomatic complexity: 570. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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 1315 states and 2094 transitions. Complement of second has 5 states. [2025-04-26 16:56:13,406 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:56:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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:56:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-26 16:56:13,408 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 15 letters. Loop has 5 letters. [2025-04-26 16:56:13,409 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:13,409 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 20 letters. Loop has 5 letters. [2025-04-26 16:56:13,409 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:13,409 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 15 letters. Loop has 10 letters. [2025-04-26 16:56:13,409 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:13,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1315 states and 2094 transitions. [2025-04-26 16:56:13,417 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 179 [2025-04-26 16:56:13,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1315 states to 1018 states and 1646 transitions. [2025-04-26 16:56:13,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 473 [2025-04-26 16:56:13,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 502 [2025-04-26 16:56:13,423 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1018 states and 1646 transitions. [2025-04-26 16:56:13,423 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:13,423 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1018 states and 1646 transitions. [2025-04-26 16:56:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states and 1646 transitions. [2025-04-26 16:56:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 769. [2025-04-26 16:56:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 769 states have (on average 1.694408322496749) internal successors, (in total 1303), 768 states have internal predecessors, (1303), 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:56:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1303 transitions. [2025-04-26 16:56:13,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 769 states and 1303 transitions. [2025-04-26 16:56:13,441 INFO L438 stractBuchiCegarLoop]: Abstraction has 769 states and 1303 transitions. [2025-04-26 16:56:13,441 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:13,441 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 769 states and 1303 transitions. [2025-04-26 16:56:13,444 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 151 [2025-04-26 16:56:13,444 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:13,444 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:13,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:13,445 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:13,446 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:56:13,446 INFO L754 eck$LassoCheckResult]: Loop: "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 16:56:13,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2091815994, now seen corresponding path program 2 times [2025-04-26 16:56:13,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216137344] [2025-04-26 16:56:13,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:56:13,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:13,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:13,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,456 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:56:13,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:13,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,466 INFO L85 PathProgramCache]: Analyzing trace with hash 131725895, now seen corresponding path program 3 times [2025-04-26 16:56:13,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603247827] [2025-04-26 16:56:13,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:56:13,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:13,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:13,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:56:13,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,472 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:13,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:13,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash -706862686, now seen corresponding path program 2 times [2025-04-26 16:56:13,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755143640] [2025-04-26 16:56:13,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:13,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:56:13,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:13,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:13,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,486 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:56:13,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:13,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,642 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:13,642 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:13,642 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:13,642 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:13,642 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:13,642 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,642 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:13,642 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:13,642 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:56:13,642 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:13,642 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:13,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,803 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:13,803 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:13,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,805 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:56:13,806 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:56:13,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:13,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,821 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:13,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:56:13,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,828 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:56:13,829 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:56:13,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:13,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,840 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:56:13,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,847 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:56:13,847 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:56:13,860 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:13,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:56:13,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,868 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:56:13,870 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:56:13,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:13,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:13,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:13,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:13,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:13,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:13,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:13,887 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:13,895 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:13,895 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:56:13,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:13,898 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:56:13,899 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:56:13,915 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:13,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:56:13,932 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:13,932 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:13,932 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2025-04-26 16:56:13,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:56:13,944 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-04-26 16:56:13,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:56:13,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:13,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:13,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:13,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:13,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:13,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:13,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:13,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:13,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:14,004 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:56:14,004 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:56:14,004 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 769 states and 1303 transitions. cyclomatic complexity: 587 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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:56:14,034 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 769 states and 1303 transitions. cyclomatic complexity: 587. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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 1208 states and 2027 transitions. Complement of second has 4 states. [2025-04-26 16:56:14,034 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:56:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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:56:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-26 16:56:14,035 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 15 letters. Loop has 5 letters. [2025-04-26 16:56:14,035 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,035 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 20 letters. Loop has 5 letters. [2025-04-26 16:56:14,036 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,036 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 15 letters. Loop has 10 letters. [2025-04-26 16:56:14,036 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1208 states and 2027 transitions. [2025-04-26 16:56:14,042 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:56:14,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1208 states to 815 states and 1363 transitions. [2025-04-26 16:56:14,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 298 [2025-04-26 16:56:14,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 372 [2025-04-26 16:56:14,046 INFO L74 IsDeterministic]: Start isDeterministic. Operand 815 states and 1363 transitions. [2025-04-26 16:56:14,046 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:14,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 815 states and 1363 transitions. [2025-04-26 16:56:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states and 1363 transitions. [2025-04-26 16:56:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 581. [2025-04-26 16:56:14,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 581 states have (on average 1.7607573149741824) internal successors, (in total 1023), 580 states have internal predecessors, (1023), 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:56:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1023 transitions. [2025-04-26 16:56:14,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 581 states and 1023 transitions. [2025-04-26 16:56:14,063 INFO L438 stractBuchiCegarLoop]: Abstraction has 581 states and 1023 transitions. [2025-04-26 16:56:14,063 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:56:14,063 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 581 states and 1023 transitions. [2025-04-26 16:56:14,064 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:56:14,065 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:14,065 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:14,065 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:14,065 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:14,066 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[105] L46-1-->thread2FINAL: Formula: (not v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" [2025-04-26 16:56:14,066 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 16:56:14,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:14,066 INFO L85 PathProgramCache]: Analyzing trace with hash 764508993, now seen corresponding path program 1 times [2025-04-26 16:56:14,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:14,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410457847] [2025-04-26 16:56:14,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:14,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:14,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:56:14,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:56:14,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,078 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:14,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:56:14,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:56:14,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:14,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:14,087 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 2 times [2025-04-26 16:56:14,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:14,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880050626] [2025-04-26 16:56:14,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:14,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:14,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:14,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:14,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:14,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:14,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:14,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:14,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:14,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash -970588316, now seen corresponding path program 1 times [2025-04-26 16:56:14,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:14,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030208416] [2025-04-26 16:56:14,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:14,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:14,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:56:14,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:56:14,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,111 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:14,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:56:14,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:56:14,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:14,332 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:14,332 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:14,332 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:14,332 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:14,332 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:14,332 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,332 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:14,332 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:14,332 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:56:14,332 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:14,332 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:14,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,650 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:14,650 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:14,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,652 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:56:14,653 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:56:14,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:14,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,668 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,673 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:56:14,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,675 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:56:14,675 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:56:14,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:14,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,690 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,697 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:56:14,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,699 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:56:14,700 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:56:14,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:14,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,715 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:14,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,723 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:56:14,725 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:56:14,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,741 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,747 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:56:14,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,749 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:56:14,750 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:56:14,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:56:14,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,764 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:56:14,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,774 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:56:14,779 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:56:14,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,794 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,800 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:56:14,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,803 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:56:14,805 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:56:14,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,821 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,827 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:56:14,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,829 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:56:14,831 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:56:14,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,845 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,851 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:56:14,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,853 INFO L229 MonitoredProcess]: Starting monitored process 27 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:56:14,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:56:14,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:14,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,869 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:56:14,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,877 INFO L229 MonitoredProcess]: Starting monitored process 28 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:56:14,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:56:14,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:14,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,889 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:56:14,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,907 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:56:14,907 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:56:14,942 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:56:14,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,950 INFO L229 MonitoredProcess]: Starting monitored process 29 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:56:14,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:56:14,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,966 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:14,973 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:14,973 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:56:14,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,975 INFO L229 MonitoredProcess]: Starting monitored process 30 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:56:14,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:56:14,976 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:14,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:14,991 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:14,991 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:14,991 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 16:56:14,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:15,002 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:15,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:15,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:56:15,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:56:15,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:15,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:15,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:15,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:15,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:15,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:15,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:15,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:15,058 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:56:15,059 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:56:15,059 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 581 states and 1023 transitions. cyclomatic complexity: 475 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (in total 22), 4 states have internal predecessors, (22), 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:56:15,091 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 581 states and 1023 transitions. cyclomatic complexity: 475. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (in total 22), 4 states have internal predecessors, (22), 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 1318 states and 2322 transitions. Complement of second has 5 states. [2025-04-26 16:56:15,091 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:56:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (in total 22), 4 states have internal predecessors, (22), 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:56:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-26 16:56:15,092 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 18 letters. Loop has 4 letters. [2025-04-26 16:56:15,092 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:15,092 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 22 letters. Loop has 4 letters. [2025-04-26 16:56:15,092 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:15,092 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:56:15,092 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:15,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1318 states and 2322 transitions. [2025-04-26 16:56:15,098 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:56:15,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1318 states to 876 states and 1560 transitions. [2025-04-26 16:56:15,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2025-04-26 16:56:15,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 305 [2025-04-26 16:56:15,102 INFO L74 IsDeterministic]: Start isDeterministic. Operand 876 states and 1560 transitions. [2025-04-26 16:56:15,102 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:15,102 INFO L218 hiAutomatonCegarLoop]: Abstraction has 876 states and 1560 transitions. [2025-04-26 16:56:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states and 1560 transitions. [2025-04-26 16:56:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 736. [2025-04-26 16:56:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 736 states have (on average 1.8016304347826086) internal successors, (in total 1326), 735 states have internal predecessors, (1326), 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:56:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1326 transitions. [2025-04-26 16:56:15,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 736 states and 1326 transitions. [2025-04-26 16:56:15,112 INFO L438 stractBuchiCegarLoop]: Abstraction has 736 states and 1326 transitions. [2025-04-26 16:56:15,112 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:56:15,112 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 736 states and 1326 transitions. [2025-04-26 16:56:15,114 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:56:15,114 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:15,114 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:15,115 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:15,115 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:15,115 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:56:15,115 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 16:56:15,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash -550446966, now seen corresponding path program 1 times [2025-04-26 16:56:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:15,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855228024] [2025-04-26 16:56:15,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:15,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:15,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:15,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:15,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,121 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:15,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:15,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:15,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:15,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:15,127 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 3 times [2025-04-26 16:56:15,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:15,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921483064] [2025-04-26 16:56:15,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:56:15,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:15,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:15,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:15,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:56:15,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:15,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:15,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:15,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:15,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1294757843, now seen corresponding path program 1 times [2025-04-26 16:56:15,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:15,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491294686] [2025-04-26 16:56:15,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:15,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:15,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:56:15,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:56:15,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,139 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:15,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:56:15,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:56:15,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:15,397 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:15,397 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:15,397 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:15,397 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:15,397 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:15,397 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:15,397 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:15,397 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:15,397 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:56:15,398 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:15,398 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:15,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,686 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:15,687 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:15,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:15,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:15,689 INFO L229 MonitoredProcess]: Starting monitored process 31 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:56:15,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:56:15,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:15,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:15,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:15,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:15,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:15,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:15,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:15,703 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:15,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:15,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:15,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:15,710 INFO L229 MonitoredProcess]: Starting monitored process 32 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:56:15,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:56:15,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:15,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:15,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:15,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:15,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:15,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:15,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:15,725 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:15,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:56:15,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:15,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:15,732 INFO L229 MonitoredProcess]: Starting monitored process 33 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:56:15,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:56:15,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:15,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:15,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:15,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:15,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:15,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:15,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:15,746 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:15,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:56:15,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:15,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:15,754 INFO L229 MonitoredProcess]: Starting monitored process 34 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:56:15,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:56:15,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:15,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:15,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:15,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:15,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:15,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:15,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:15,768 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:15,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:56:15,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:15,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:15,775 INFO L229 MonitoredProcess]: Starting monitored process 35 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:56:15,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:56:15,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:15,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:15,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:15,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:15,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:15,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:15,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:15,789 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:15,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:56:15,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:15,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:15,796 INFO L229 MonitoredProcess]: Starting monitored process 36 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:56:15,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:56:15,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:15,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:15,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:15,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:15,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:15,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:15,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:15,811 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:15,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:56:15,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:15,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:15,819 INFO L229 MonitoredProcess]: Starting monitored process 37 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:56:15,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:56:15,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:15,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:15,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:15,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:15,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:15,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:15,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:15,835 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:15,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:15,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:15,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:15,843 INFO L229 MonitoredProcess]: Starting monitored process 38 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:56:15,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:56:15,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:15,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:15,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:15,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:15,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:15,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:15,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:15,861 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:15,867 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:56:15,868 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:56:15,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:15,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:15,869 INFO L229 MonitoredProcess]: Starting monitored process 39 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:56:15,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:56:15,871 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:15,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:56:15,886 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:15,887 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:15,887 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 16:56:15,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:15,899 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-04-26 16:56:15,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:15,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:15,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:15,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:15,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:15,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:15,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:15,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:15,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:15,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:15,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:15,968 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:56:15,969 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:56:15,969 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 736 states and 1326 transitions. cyclomatic complexity: 650 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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:56:16,005 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 736 states and 1326 transitions. cyclomatic complexity: 650. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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 1397 states and 2390 transitions. Complement of second has 5 states. [2025-04-26 16:56:16,006 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:56:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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:56:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-04-26 16:56:16,007 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 16:56:16,007 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:16,007 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:56:16,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:16,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:16,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:16,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:16,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:16,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:16,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:16,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:16,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:16,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:16,071 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:56:16,071 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:16,072 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 736 states and 1326 transitions. cyclomatic complexity: 650 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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:56:16,110 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 736 states and 1326 transitions. cyclomatic complexity: 650. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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 2201 states and 3809 transitions. Complement of second has 7 states. [2025-04-26 16:56:16,111 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:56:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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:56:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-04-26 16:56:16,111 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 16:56:16,112 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:16,112 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:56:16,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:16,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:16,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:16,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:16,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:16,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:16,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:16,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:16,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:16,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:16,171 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:56:16,171 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:16,171 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 736 states and 1326 transitions. cyclomatic complexity: 650 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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:56:16,198 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 736 states and 1326 transitions. cyclomatic complexity: 650. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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 1763 states and 3038 transitions. Complement of second has 7 states. [2025-04-26 16:56:16,198 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:56:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 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:56:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-04-26 16:56:16,199 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 16:56:16,199 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:16,199 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 27 letters. Loop has 4 letters. [2025-04-26 16:56:16,199 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:16,199 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 23 letters. Loop has 8 letters. [2025-04-26 16:56:16,199 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:16,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1763 states and 3038 transitions. [2025-04-26 16:56:16,206 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:16,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1763 states to 1023 states and 1742 transitions. [2025-04-26 16:56:16,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 231 [2025-04-26 16:56:16,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2025-04-26 16:56:16,211 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1023 states and 1742 transitions. [2025-04-26 16:56:16,211 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:16,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1023 states and 1742 transitions. [2025-04-26 16:56:16,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states and 1742 transitions. [2025-04-26 16:56:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 648. [2025-04-26 16:56:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 648 states have (on average 1.6944444444444444) internal successors, (in total 1098), 647 states have internal predecessors, (1098), 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:56:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1098 transitions. [2025-04-26 16:56:16,220 INFO L240 hiAutomatonCegarLoop]: Abstraction has 648 states and 1098 transitions. [2025-04-26 16:56:16,220 INFO L438 stractBuchiCegarLoop]: Abstraction has 648 states and 1098 transitions. [2025-04-26 16:56:16,220 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:56:16,220 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 648 states and 1098 transitions. [2025-04-26 16:56:16,222 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:16,222 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:16,222 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:16,223 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:16,223 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:16,223 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[105] L46-1-->thread2FINAL: Formula: (not v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:56:16,223 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 16:56:16,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,223 INFO L85 PathProgramCache]: Analyzing trace with hash 811393748, now seen corresponding path program 1 times [2025-04-26 16:56:16,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:16,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466889535] [2025-04-26 16:56:16,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:16,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:16,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:16,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:16,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:16,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:16,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466889535] [2025-04-26 16:56:16,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466889535] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:56:16,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916915278] [2025-04-26 16:56:16,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:16,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:56:16,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,296 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-26 16:56:16,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:16,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:16,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:16,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:56:16,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:16,359 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-26 16:56:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:16,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:56:16,419 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-26 16:56:16,419 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 10 [2025-04-26 16:56:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:16,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916915278] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:56:16,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:56:16,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-26 16:56:16,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951959035] [2025-04-26 16:56:16,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:56:16,431 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:16,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,431 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 4 times [2025-04-26 16:56:16,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:16,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538053499] [2025-04-26 16:56:16,431 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:56:16,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:16,433 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-04-26 16:56:16,435 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:16,435 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:56:16,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,435 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:16,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:16,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:16,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:16,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:16,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-26 16:56:16,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-26 16:56:16,492 INFO L87 Difference]: Start difference. First operand 648 states and 1098 transitions. cyclomatic complexity: 494 Second operand has 9 states, 8 states have (on average 5.375) internal successors, (in total 43), 8 states have internal predecessors, (43), 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:56:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:16,572 INFO L93 Difference]: Finished difference Result 1259 states and 2085 transitions. [2025-04-26 16:56:16,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1259 states and 2085 transitions. [2025-04-26 16:56:16,577 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:16,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1259 states to 1218 states and 2022 transitions. [2025-04-26 16:56:16,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 326 [2025-04-26 16:56:16,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 326 [2025-04-26 16:56:16,581 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1218 states and 2022 transitions. [2025-04-26 16:56:16,581 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:16,581 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1218 states and 2022 transitions. [2025-04-26 16:56:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states and 2022 transitions. [2025-04-26 16:56:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 831. [2025-04-26 16:56:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 831 states have (on average 1.6859205776173285) internal successors, (in total 1401), 830 states have internal predecessors, (1401), 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:56:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1401 transitions. [2025-04-26 16:56:16,593 INFO L240 hiAutomatonCegarLoop]: Abstraction has 831 states and 1401 transitions. [2025-04-26 16:56:16,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:56:16,593 INFO L438 stractBuchiCegarLoop]: Abstraction has 831 states and 1401 transitions. [2025-04-26 16:56:16,593 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:56:16,594 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 831 states and 1401 transitions. [2025-04-26 16:56:16,596 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:16,596 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:16,596 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:16,596 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:16,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:16,597 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[105] L46-1-->thread2FINAL: Formula: (not v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:56:16,597 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 16:56:16,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1097516099, now seen corresponding path program 2 times [2025-04-26 16:56:16,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:16,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715593435] [2025-04-26 16:56:16,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:16,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:16,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-26 16:56:16,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 28 statements. [2025-04-26 16:56:16,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:16,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-26 16:56:16,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:16,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715593435] [2025-04-26 16:56:16,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715593435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:16,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:16,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:56:16,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122111228] [2025-04-26 16:56:16,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:16,652 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:16,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 5 times [2025-04-26 16:56:16,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:16,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240739994] [2025-04-26 16:56:16,652 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:56:16,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:16,654 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:16,656 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:16,656 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:16,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,656 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:16,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:16,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:16,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:16,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:56:16,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:56:16,707 INFO L87 Difference]: Start difference. First operand 831 states and 1401 transitions. cyclomatic complexity: 636 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 5 states have internal predecessors, (24), 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:56:16,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:16,751 INFO L93 Difference]: Finished difference Result 845 states and 1414 transitions. [2025-04-26 16:56:16,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 845 states and 1414 transitions. [2025-04-26 16:56:16,754 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:16,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 845 states to 831 states and 1400 transitions. [2025-04-26 16:56:16,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2025-04-26 16:56:16,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 234 [2025-04-26 16:56:16,758 INFO L74 IsDeterministic]: Start isDeterministic. Operand 831 states and 1400 transitions. [2025-04-26 16:56:16,758 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:16,758 INFO L218 hiAutomatonCegarLoop]: Abstraction has 831 states and 1400 transitions. [2025-04-26 16:56:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states and 1400 transitions. [2025-04-26 16:56:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2025-04-26 16:56:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 831 states have (on average 1.6847172081829123) internal successors, (in total 1400), 830 states have internal predecessors, (1400), 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:56:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1400 transitions. [2025-04-26 16:56:16,769 INFO L240 hiAutomatonCegarLoop]: Abstraction has 831 states and 1400 transitions. [2025-04-26 16:56:16,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:56:16,770 INFO L438 stractBuchiCegarLoop]: Abstraction has 831 states and 1400 transitions. [2025-04-26 16:56:16,770 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:56:16,770 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 831 states and 1400 transitions. [2025-04-26 16:56:16,772 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:16,772 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:16,772 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:16,773 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:16,773 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:16,773 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[105] L46-1-->thread2FINAL: Formula: (not v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:56:16,773 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 16:56:16,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,774 INFO L85 PathProgramCache]: Analyzing trace with hash 640108354, now seen corresponding path program 2 times [2025-04-26 16:56:16,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:16,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215213644] [2025-04-26 16:56:16,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:16,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:16,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-26 16:56:16,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:56:16,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:56:16,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:16,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:16,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215213644] [2025-04-26 16:56:16,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215213644] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:56:16,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197832426] [2025-04-26 16:56:16,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:16,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:56:16,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,979 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-26 16:56:16,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-26 16:56:17,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:56:17,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:56:17,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:17,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:56:17,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:17,046 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-26 16:56:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:17,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:56:17,090 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-26 16:56:17,090 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-26 16:56:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:17,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197832426] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:56:17,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:56:17,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2025-04-26 16:56:17,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967768453] [2025-04-26 16:56:17,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:56:17,102 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:17,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,102 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 6 times [2025-04-26 16:56:17,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720178326] [2025-04-26 16:56:17,103 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:56:17,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,104 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:17,105 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:17,105 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:56:17,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,105 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:17,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:17,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:17,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:17,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:17,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-26 16:56:17,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-26 16:56:17,147 INFO L87 Difference]: Start difference. First operand 831 states and 1400 transitions. cyclomatic complexity: 635 Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (in total 50), 11 states have internal predecessors, (50), 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:56:17,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:17,305 INFO L93 Difference]: Finished difference Result 1708 states and 2826 transitions. [2025-04-26 16:56:17,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1708 states and 2826 transitions. [2025-04-26 16:56:17,311 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:17,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1708 states to 1667 states and 2757 transitions. [2025-04-26 16:56:17,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 420 [2025-04-26 16:56:17,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 420 [2025-04-26 16:56:17,317 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1667 states and 2757 transitions. [2025-04-26 16:56:17,317 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:17,317 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1667 states and 2757 transitions. [2025-04-26 16:56:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states and 2757 transitions. [2025-04-26 16:56:17,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1223. [2025-04-26 16:56:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1223 states have (on average 1.688470973017171) internal successors, (in total 2065), 1222 states have internal predecessors, (2065), 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:56:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 2065 transitions. [2025-04-26 16:56:17,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1223 states and 2065 transitions. [2025-04-26 16:56:17,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-26 16:56:17,334 INFO L438 stractBuchiCegarLoop]: Abstraction has 1223 states and 2065 transitions. [2025-04-26 16:56:17,334 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:56:17,334 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1223 states and 2065 transitions. [2025-04-26 16:56:17,337 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:17,337 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:17,337 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:17,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:17,337 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:17,337 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[105] L46-1-->thread2FINAL: Formula: (not v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:56:17,338 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 16:56:17,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1565367790, now seen corresponding path program 3 times [2025-04-26 16:56:17,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815772370] [2025-04-26 16:56:17,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:56:17,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-04-26 16:56:17,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:56:17,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:56:17,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:17,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:17,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815772370] [2025-04-26 16:56:17,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815772370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:17,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:17,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:56:17,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933408378] [2025-04-26 16:56:17,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:17,389 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:17,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,389 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 7 times [2025-04-26 16:56:17,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393732460] [2025-04-26 16:56:17,389 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:56:17,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:17,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:17,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:17,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:17,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:17,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:17,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:17,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:56:17,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:56:17,434 INFO L87 Difference]: Start difference. First operand 1223 states and 2065 transitions. cyclomatic complexity: 953 Second operand has 6 states, 6 states have (on average 5.0) internal successors, (in total 30), 5 states have internal predecessors, (30), 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:56:17,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:17,471 INFO L93 Difference]: Finished difference Result 1466 states and 2406 transitions. [2025-04-26 16:56:17,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1466 states and 2406 transitions. [2025-04-26 16:56:17,476 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:17,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1466 states to 1403 states and 2338 transitions. [2025-04-26 16:56:17,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 349 [2025-04-26 16:56:17,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 349 [2025-04-26 16:56:17,481 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1403 states and 2338 transitions. [2025-04-26 16:56:17,481 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:17,481 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1403 states and 2338 transitions. [2025-04-26 16:56:17,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states and 2338 transitions. [2025-04-26 16:56:17,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1227. [2025-04-26 16:56:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1227 states have (on average 1.6862265688671556) internal successors, (in total 2069), 1226 states have internal predecessors, (2069), 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:56:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 2069 transitions. [2025-04-26 16:56:17,496 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1227 states and 2069 transitions. [2025-04-26 16:56:17,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:56:17,497 INFO L438 stractBuchiCegarLoop]: Abstraction has 1227 states and 2069 transitions. [2025-04-26 16:56:17,497 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 16:56:17,497 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1227 states and 2069 transitions. [2025-04-26 16:56:17,499 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:56:17,499 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:17,499 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:17,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:17,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:17,500 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[105] L46-1-->thread2FINAL: Formula: (not v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:56:17,500 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 16:56:17,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1636815046, now seen corresponding path program 4 times [2025-04-26 16:56:17,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363495781] [2025-04-26 16:56:17,501 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:56:17,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,503 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-26 16:56:17,508 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:56:17,508 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:56:17,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:17,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:56:17,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:56:17,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:17,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,514 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 8 times [2025-04-26 16:56:17,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635246918] [2025-04-26 16:56:17,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:17,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:17,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:17,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:17,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,516 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:17,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:17,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:17,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:17,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2144858403, now seen corresponding path program 1 times [2025-04-26 16:56:17,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249848331] [2025-04-26 16:56:17,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-26 16:56:17,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-26 16:56:17,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:17,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-26 16:56:17,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-26 16:56:17,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:17,919 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:17,920 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:17,920 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:17,920 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:17,920 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:17,920 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:17,920 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:17,920 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:17,920 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_petrified1_Iteration12_Lasso [2025-04-26 16:56:17,920 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:17,920 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:17,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:18,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:18,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:18,297 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:18,297 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:18,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,299 INFO L229 MonitoredProcess]: Starting monitored process 42 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:56:18,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:56:18,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:18,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,314 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 16:56:18,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,322 INFO L229 MonitoredProcess]: Starting monitored process 43 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:56:18,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:56:18,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:18,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,337 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 16:56:18,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,344 INFO L229 MonitoredProcess]: Starting monitored process 44 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:56:18,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:56:18,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:18,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,362 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 16:56:18,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,371 INFO L229 MonitoredProcess]: Starting monitored process 45 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:56:18,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:56:18,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:18,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,387 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:18,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,395 INFO L229 MonitoredProcess]: Starting monitored process 46 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:56:18,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:56:18,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:18,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,412 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:18,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,420 INFO L229 MonitoredProcess]: Starting monitored process 47 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:56:18,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:56:18,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:18,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,437 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 16:56:18,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,445 INFO L229 MonitoredProcess]: Starting monitored process 48 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:56:18,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:56:18,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:18,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,461 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:18,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,469 INFO L229 MonitoredProcess]: Starting monitored process 49 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:56:18,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:56:18,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:18,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,485 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 16:56:18,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,493 INFO L229 MonitoredProcess]: Starting monitored process 50 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:56:18,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:56:18,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:18,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,509 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:18,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,518 INFO L229 MonitoredProcess]: Starting monitored process 51 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:56:18,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:56:18,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:18,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,532 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 16:56:18,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,539 INFO L229 MonitoredProcess]: Starting monitored process 52 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:56:18,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:56:18,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:18,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,550 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:56:18,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,573 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:56:18,574 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:56:18,618 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 16:56:18,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,627 INFO L229 MonitoredProcess]: Starting monitored process 53 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:56:18,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:56:18,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:56:18,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,645 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:18,657 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:56:18,657 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:56:18,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,660 INFO L229 MonitoredProcess]: Starting monitored process 54 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:56:18,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 16:56:18,663 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:18,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-04-26 16:56:18,680 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:18,680 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:18,680 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 16:56:18,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 16:56:18,697 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2025-04-26 16:56:18,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:56:18,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:56:18,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:18,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:18,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:18,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:18,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:18,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:18,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:18,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:18,772 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:56:18,773 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:56:18,773 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1227 states and 2069 transitions. cyclomatic complexity: 953 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 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:56:18,789 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1227 states and 2069 transitions. cyclomatic complexity: 953. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 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 1279 states and 2150 transitions. Complement of second has 4 states. [2025-04-26 16:56:18,790 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:56:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 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:56:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-26 16:56:18,791 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 33 letters. Loop has 4 letters. [2025-04-26 16:56:18,791 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:18,791 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 37 letters. Loop has 4 letters. [2025-04-26 16:56:18,791 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:18,791 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 33 letters. Loop has 8 letters. [2025-04-26 16:56:18,791 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:18,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 2150 transitions. [2025-04-26 16:56:18,795 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:18,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 0 states and 0 transitions. [2025-04-26 16:56:18,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:18,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:18,795 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:18,795 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:18,795 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:18,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:18,795 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:18,795 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 16:56:18,795 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:18,795 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:18,795 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:18,807 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:56:18,809 INFO L201 PluginConnector]: Adding new model queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:18 BoogieIcfgContainer [2025-04-26 16:56:18,809 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:18,810 INFO L158 Benchmark]: Toolchain (without parser) took 8566.12ms. Allocated memory was 159.4MB in the beginning and 188.7MB in the end (delta: 29.4MB). Free memory was 86.1MB in the beginning and 79.3MB in the end (delta: 6.8MB). Peak memory consumption was 40.5MB. Max. memory is 8.0GB. [2025-04-26 16:56:18,810 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:18,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.99ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 84.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:18,811 INFO L158 Benchmark]: Boogie Preprocessor took 25.22ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:18,811 INFO L158 Benchmark]: RCFGBuilder took 203.89ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 72.3MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:56:18,812 INFO L158 Benchmark]: BuchiAutomizer took 8297.32ms. Allocated memory was 159.4MB in the beginning and 188.7MB in the end (delta: 29.4MB). Free memory was 72.2MB in the beginning and 79.3MB in the end (delta: -7.1MB). Peak memory consumption was 27.9MB. Max. memory is 8.0GB. [2025-04-26 16:56:18,813 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.17ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.99ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 84.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.22ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 203.89ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 72.3MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 8297.32ms. Allocated memory was 159.4MB in the beginning and 188.7MB in the end (delta: 29.4MB). Free memory was 72.2MB in the beginning and 79.3MB in the end (delta: -7.1MB). Peak memory consumption was 27.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 13 iterations. TraceHistogramMax:4. Analysis of lassos took 6.1s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 2243 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 717 mSDsluCounter, 1101 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 668 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 790 IncrementalHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 433 mSDtfsCounter, 790 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital95 mio100 ax100 hnf100 lsp74 ukn92 mio100 lsp61 div100 bol108 ite100 ukn100 eq192 hnf90 smp100 dnf203 smp76 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 86ms VariablesStem: 4 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 307, Number of transitions in reduction automaton: 727, Number of states in reduction automaton: 458, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (5 trivial, 6 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One nondeterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 12 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:18,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:19,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:19,226 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...