/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-more/queue-add-3-nl.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:49,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:49,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:49,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:49,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:49,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:55:49,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:49,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:49,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:49,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:49,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:49,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:49,781 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:49,781 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:49,781 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:49,781 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:49,781 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:49,781 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:49,781 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:49,781 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:49,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:49,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:49,781 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:49,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:49,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:49,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:49,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:49,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:49,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:49,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:49,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:49,782 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:49,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:49,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:49,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:49,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:49,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:49,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:49,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:49,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:49,783 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:49,783 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:49,783 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:50,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:50,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:50,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:50,135 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:50,136 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:50,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-3-nl.wvr.bpl [2025-04-26 16:55:50,140 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-3-nl.wvr.bpl' [2025-04-26 16:55:50,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:50,164 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:50,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:50,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:50,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:50,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:50" (1/1) ... [2025-04-26 16:55:50,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:50" (1/1) ... [2025-04-26 16:55:50,215 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:50,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:50,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:50,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:50,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:50,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:50" (1/1) ... [2025-04-26 16:55:50,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:50" (1/1) ... [2025-04-26 16:55:50,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:50" (1/1) ... [2025-04-26 16:55:50,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:50" (1/1) ... [2025-04-26 16:55:50,233 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:50" (1/1) ... [2025-04-26 16:55:50,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:50" (1/1) ... [2025-04-26 16:55:50,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:50" (1/1) ... [2025-04-26 16:55:50,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:50" (1/1) ... [2025-04-26 16:55:50,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:50" (1/1) ... [2025-04-26 16:55:50,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:50,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:50,257 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:50,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:50,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:50" (1/1) ... [2025-04-26 16:55:50,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:50,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:50,284 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:55:50,286 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:55:50,307 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:50,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:50,308 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:50,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:50,308 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:50,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:50,308 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:55:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:55:50,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:55:50,309 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:55:50,351 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:50,352 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:50,473 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:50,473 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:50,495 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:50,496 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:50,496 INFO L201 PluginConnector]: Adding new model queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:50 BoogieIcfgContainer [2025-04-26 16:55:50,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:50,497 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:50,497 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:50,502 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:50,503 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:50,503 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:50" (1/2) ... [2025-04-26 16:55:50,504 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7dad6584 and model type queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:50, skipping insertion in model container [2025-04-26 16:55:50,504 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:50,504 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:50" (2/2) ... [2025-04-26 16:55:50,505 INFO L376 chiAutomizerObserver]: Analyzing ICFG queue-add-3-nl.wvr.bpl [2025-04-26 16:55:50,549 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:55:50,593 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:50,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:50,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:50,596 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:55:50,597 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:55:50,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 111 flow [2025-04-26 16:55:50,661 INFO L116 PetriNetUnfolderBase]: 3/39 cut-off events. [2025-04-26 16:55:50,663 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:55:50,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-04-26 16:55:50,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 45 transitions, 111 flow [2025-04-26 16:55:50,668 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 96 flow [2025-04-26 16:55:50,669 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 46 places, 39 transitions, 96 flow [2025-04-26 16:55:50,674 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:50,968 WARN L140 AmpleReduction]: Number of pruned transitions: 1133 [2025-04-26 16:55:50,968 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:55:50,968 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 112 [2025-04-26 16:55:50,968 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:31 [2025-04-26 16:55:50,968 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:596 [2025-04-26 16:55:50,968 WARN L145 AmpleReduction]: Times succ was already a loop node:33 [2025-04-26 16:55:50,968 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:187 [2025-04-26 16:55:50,968 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:50,973 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 740 states, 738 states have (on average 1.4471544715447155) internal successors, (in total 1068), 739 states have internal predecessors, (1068), 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:55:50,980 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:50,980 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:50,980 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:50,980 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:50,980 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:50,980 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:50,980 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:50,980 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:50,983 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 740 states, 738 states have (on average 1.4471544715447155) internal successors, (in total 1068), 739 states have internal predecessors, (1068), 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:55:51,028 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 519 [2025-04-26 16:55:51,028 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:51,028 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:51,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:55:51,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:55:51,032 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:51,033 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 740 states, 738 states have (on average 1.4471544715447155) internal successors, (in total 1068), 739 states have internal predecessors, (1068), 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:55:51,042 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 519 [2025-04-26 16:55:51,042 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:51,042 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:51,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:55:51,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:55:51,048 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" [2025-04-26 16:55:51,048 INFO L754 eck$LassoCheckResult]: Loop: "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-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:55:51,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:51,054 INFO L85 PathProgramCache]: Analyzing trace with hash 132071, now seen corresponding path program 1 times [2025-04-26 16:55:51,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:51,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377885986] [2025-04-26 16:55:51,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:51,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:51,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:51,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:51,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:51,109 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:51,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:51,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:51,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:51,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:51,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:51,131 INFO L85 PathProgramCache]: Analyzing trace with hash 4188677, now seen corresponding path program 1 times [2025-04-26 16:55:51,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:51,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070323516] [2025-04-26 16:55:51,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:51,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:51,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:51,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:51,141 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:51,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:51,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:51,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:51,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:51,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:51,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1714522859, now seen corresponding path program 1 times [2025-04-26 16:55:51,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:51,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664005831] [2025-04-26 16:55:51,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:51,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:51,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:51,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:51,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:51,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:51,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:51,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:51,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:51,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:51,330 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:51,331 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:51,331 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:51,331 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:51,331 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:51,331 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:51,332 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:51,332 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:51,332 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:55:51,332 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:51,332 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:51,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:51,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:51,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:51,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:51,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:51,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:51,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:51,512 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:51,515 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:51,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:51,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:51,518 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:55:51,520 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:55:51,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:51,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:51,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:51,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:51,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:51,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:51,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:51,548 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:51,554 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:55:51,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:51,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:51,556 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:55:51,557 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:55:51,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:51,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:51,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:51,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:51,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:51,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:51,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:51,577 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:51,587 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:55:51,587 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:55:51,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:51,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:51,590 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:55:51,592 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:55:51,594 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:51,610 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:55:51,611 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:51,611 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:51,611 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:55:51,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:55:51,619 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:51,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:51,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:51,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:51,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:51,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:51,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:51,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:51,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:51,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:51,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:51,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:51,696 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:55:51,711 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:55:51,714 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 740 states, 738 states have (on average 1.4471544715447155) internal successors, (in total 1068), 739 states have internal predecessors, (1068), 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.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:55:51,834 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 740 states, 738 states have (on average 1.4471544715447155) internal successors, (in total 1068), 739 states have internal predecessors, (1068), 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.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 1583 states and 2371 transitions. Complement of second has 7 states. [2025-04-26 16:55:51,836 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:55:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:55:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-04-26 16:55:51,844 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:55:51,845 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:51,845 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:55:51,845 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:51,845 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 16:55:51,845 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:51,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1583 states and 2371 transitions. [2025-04-26 16:55:51,857 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 16:55:51,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1583 states to 814 states and 1170 transitions. [2025-04-26 16:55:51,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2025-04-26 16:55:51,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 456 [2025-04-26 16:55:51,866 INFO L74 IsDeterministic]: Start isDeterministic. Operand 814 states and 1170 transitions. [2025-04-26 16:55:51,867 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:51,867 INFO L218 hiAutomatonCegarLoop]: Abstraction has 814 states and 1170 transitions. [2025-04-26 16:55:51,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states and 1170 transitions. [2025-04-26 16:55:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 773. [2025-04-26 16:55:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 773 states have (on average 1.4605433376455368) internal successors, (in total 1129), 772 states have internal predecessors, (1129), 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:55:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1129 transitions. [2025-04-26 16:55:51,914 INFO L240 hiAutomatonCegarLoop]: Abstraction has 773 states and 1129 transitions. [2025-04-26 16:55:51,914 INFO L438 stractBuchiCegarLoop]: Abstraction has 773 states and 1129 transitions. [2025-04-26 16:55:51,914 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:51,914 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 773 states and 1129 transitions. [2025-04-26 16:55:51,916 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 16:55:51,917 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:51,917 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:51,917 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:51,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:55:51,917 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[111] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" [2025-04-26 16:55:51,918 INFO L754 eck$LassoCheckResult]: Loop: "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" [2025-04-26 16:55:51,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash 682457567, now seen corresponding path program 1 times [2025-04-26 16:55:51,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:51,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365347569] [2025-04-26 16:55:51,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:51,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:51,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:51,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:51,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:51,924 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:51,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:51,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:51,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:51,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:51,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:51,931 INFO L85 PathProgramCache]: Analyzing trace with hash 26157701, now seen corresponding path program 1 times [2025-04-26 16:55:51,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:51,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492506319] [2025-04-26 16:55:51,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:51,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:51,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:51,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:51,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:51,940 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:51,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:51,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:51,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:51,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:51,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:51,944 INFO L85 PathProgramCache]: Analyzing trace with hash -433766941, now seen corresponding path program 1 times [2025-04-26 16:55:51,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:51,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899466921] [2025-04-26 16:55:51,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:51,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:51,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:55:51,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:55:51,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:51,955 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:51,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:55:51,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:55:51,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:51,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:51,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:52,161 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:52,161 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:52,161 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:52,161 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:52,161 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:52,161 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:52,161 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:52,161 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:52,161 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:55:52,161 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:52,161 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:52,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:52,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:52,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:52,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:52,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:52,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:52,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:52,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:52,487 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:52,487 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:52,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:52,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:52,489 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:55:52,491 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:55:52,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:52,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:52,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:52,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:52,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:52,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:52,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:52,507 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:52,512 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:55:52,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:52,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:52,515 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:55:52,516 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:55:52,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:52,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:52,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:52,528 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:55:52,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:52,563 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:55:52,564 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:55:52,595 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:52,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:52,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:52,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:52,604 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:55:52,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:52,607 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:55:52,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:52,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:52,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:52,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:52,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:52,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:52,622 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:52,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:55:52,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:52,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:52,631 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:55:52,632 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:55:52,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:52,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:52,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:52,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:52,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:52,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:52,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:52,650 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:52,657 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:55:52,658 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:55:52,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:52,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:52,660 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:55:52,661 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:55:52,662 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:52,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:52,679 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:52,679 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:52,679 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:55:52,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:52,689 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:52,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:52,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:52,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:52,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:52,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:52,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:52,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:52,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:52,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:52,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:52,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:52,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:52,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:52,763 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:55:52,765 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:55:52,765 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 773 states and 1129 transitions. cyclomatic complexity: 394 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:52,807 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 773 states and 1129 transitions. cyclomatic complexity: 394. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1326 states and 1900 transitions. Complement of second has 5 states. [2025-04-26 16:55:52,807 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:55:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:52,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-04-26 16:55:52,808 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 16:55:52,808 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:52,808 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 16 letters. Loop has 6 letters. [2025-04-26 16:55:52,808 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:52,808 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 10 letters. Loop has 12 letters. [2025-04-26 16:55:52,809 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:52,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1326 states and 1900 transitions. [2025-04-26 16:55:52,815 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 226 [2025-04-26 16:55:52,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1326 states to 1112 states and 1606 transitions. [2025-04-26 16:55:52,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 547 [2025-04-26 16:55:52,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 584 [2025-04-26 16:55:52,821 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1112 states and 1606 transitions. [2025-04-26 16:55:52,821 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:52,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1112 states and 1606 transitions. [2025-04-26 16:55:52,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states and 1606 transitions. [2025-04-26 16:55:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 987. [2025-04-26 16:55:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 987 states have (on average 1.4569402228976698) internal successors, (in total 1438), 986 states have internal predecessors, (1438), 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:55:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1438 transitions. [2025-04-26 16:55:52,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 987 states and 1438 transitions. [2025-04-26 16:55:52,837 INFO L438 stractBuchiCegarLoop]: Abstraction has 987 states and 1438 transitions. [2025-04-26 16:55:52,837 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:55:52,837 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 987 states and 1438 transitions. [2025-04-26 16:55:52,840 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 16:55:52,840 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:52,840 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:52,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:52,840 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:52,840 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[111] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[115] L52-1-->thread2FINAL: Formula: (not v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" "[117] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" [2025-04-26 16:55:52,841 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-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]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:55:52,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash 954905804, now seen corresponding path program 1 times [2025-04-26 16:55:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:52,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348986414] [2025-04-26 16:55:52,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:52,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:52,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:55:52,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:55:52,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:52,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:52,870 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:55:52,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:52,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348986414] [2025-04-26 16:55:52,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348986414] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:52,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:52,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:55:52,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744777175] [2025-04-26 16:55:52,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:52,874 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:52,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:52,874 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 1 times [2025-04-26 16:55:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:52,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645431982] [2025-04-26 16:55:52,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:52,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:52,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:52,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:52,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:52,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:52,879 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:52,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:52,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:52,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:52,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:52,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:52,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:52,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:55:52,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:55:52,952 INFO L87 Difference]: Start difference. First operand 987 states and 1438 transitions. cyclomatic complexity: 497 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:55:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:53,002 INFO L93 Difference]: Finished difference Result 1073 states and 1553 transitions. [2025-04-26 16:55:53,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1073 states and 1553 transitions. [2025-04-26 16:55:53,006 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 16:55:53,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1073 states to 1068 states and 1548 transitions. [2025-04-26 16:55:53,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 538 [2025-04-26 16:55:53,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 538 [2025-04-26 16:55:53,011 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1068 states and 1548 transitions. [2025-04-26 16:55:53,011 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:53,011 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1068 states and 1548 transitions. [2025-04-26 16:55:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states and 1548 transitions. [2025-04-26 16:55:53,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1047. [2025-04-26 16:55:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1047 states have (on average 1.448901623686724) internal successors, (in total 1517), 1046 states have internal predecessors, (1517), 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:55:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1517 transitions. [2025-04-26 16:55:53,032 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1047 states and 1517 transitions. [2025-04-26 16:55:53,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:55:53,034 INFO L438 stractBuchiCegarLoop]: Abstraction has 1047 states and 1517 transitions. [2025-04-26 16:55:53,034 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:55:53,034 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1047 states and 1517 transitions. [2025-04-26 16:55:53,037 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 16:55:53,037 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:53,037 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:53,038 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:53,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:55:53,039 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:53,040 INFO L754 eck$LassoCheckResult]: Loop: "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:53,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash 901811640, now seen corresponding path program 1 times [2025-04-26 16:55:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:53,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642223957] [2025-04-26 16:55:53,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:53,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:53,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:55:53,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:55:53,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:53,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:55:53,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:55:53,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:53,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,069 INFO L85 PathProgramCache]: Analyzing trace with hash 84370301, now seen corresponding path program 2 times [2025-04-26 16:55:53,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:53,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849779170] [2025-04-26 16:55:53,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:53,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:53,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:53,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:53,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:53,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,075 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:53,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:53,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:53,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:53,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1979806732, now seen corresponding path program 1 times [2025-04-26 16:55:53,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:53,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193044500] [2025-04-26 16:55:53,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:53,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:53,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:55:53,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:55:53,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,092 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:53,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:55:53,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:55:53,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:53,355 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:53,356 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:53,356 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:53,356 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:53,356 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:53,356 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,356 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:53,356 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:53,356 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:55:53,356 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:53,356 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:53,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,565 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:53,565 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:53,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,570 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:55:53,572 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:55:53,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:53,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:53,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:53,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:53,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:53,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:53,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:53,586 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:53,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:53,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,597 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:55:53,598 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:55:53,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:53,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:53,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:53,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:53,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:53,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:53,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:53,612 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:53,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:55:53,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,620 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:55:53,621 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:55:53,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:53,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:53,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:53,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:53,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:53,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:53,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:53,638 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:53,650 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:55:53,651 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:55:53,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,653 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:55:53,654 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:55:53,655 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:53,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:53,672 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:53,672 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:53,672 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:55:53,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:53,684 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:55:53,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:55:53,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:55:53,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:53,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:53,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:53,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:53,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:53,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:53,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:53,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:53,754 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:55:53,754 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:55:53,754 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1047 states and 1517 transitions. cyclomatic complexity: 519 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 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:55:53,795 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1047 states and 1517 transitions. cyclomatic complexity: 519. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 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 1781 states and 2535 transitions. Complement of second has 5 states. [2025-04-26 16:55:53,795 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:55:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 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:55:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-04-26 16:55:53,796 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 18 letters. Loop has 6 letters. [2025-04-26 16:55:53,796 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:53,796 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 24 letters. Loop has 6 letters. [2025-04-26 16:55:53,796 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:53,796 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 18 letters. Loop has 12 letters. [2025-04-26 16:55:53,796 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:53,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1781 states and 2535 transitions. [2025-04-26 16:55:53,805 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 226 [2025-04-26 16:55:53,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1781 states to 1399 states and 1992 transitions. [2025-04-26 16:55:53,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 667 [2025-04-26 16:55:53,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 695 [2025-04-26 16:55:53,811 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1399 states and 1992 transitions. [2025-04-26 16:55:53,812 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:53,812 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1399 states and 1992 transitions. [2025-04-26 16:55:53,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states and 1992 transitions. [2025-04-26 16:55:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1080. [2025-04-26 16:55:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1080 states have (on average 1.45) internal successors, (in total 1566), 1079 states have internal predecessors, (1566), 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:55:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1566 transitions. [2025-04-26 16:55:53,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1080 states and 1566 transitions. [2025-04-26 16:55:53,833 INFO L438 stractBuchiCegarLoop]: Abstraction has 1080 states and 1566 transitions. [2025-04-26 16:55:53,833 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:55:53,833 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1080 states and 1566 transitions. [2025-04-26 16:55:53,836 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 16:55:53,836 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:53,836 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:53,836 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:53,836 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:53,837 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[111] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[115] L52-1-->thread2FINAL: Formula: (not v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" [2025-04-26 16:55:53,837 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-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]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:55:53,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1259012739, now seen corresponding path program 1 times [2025-04-26 16:55:53,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:53,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978209099] [2025-04-26 16:55:53,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:53,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:53,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:55:53,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:55:53,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,863 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:53,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:55:53,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:55:53,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:53,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 2 times [2025-04-26 16:55:53,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:53,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482721738] [2025-04-26 16:55:53,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:53,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:53,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:53,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:53,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:53,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:53,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:53,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:53,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash -635789789, now seen corresponding path program 1 times [2025-04-26 16:55:53,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:53,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856928686] [2025-04-26 16:55:53,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:53,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:53,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:55:53,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:55:53,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:53,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:55:53,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:55:53,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:54,158 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:54,158 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:54,158 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:54,158 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:54,158 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:54,158 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,158 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:54,158 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:54,158 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:55:54,158 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:54,159 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:54,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,402 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:54,402 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:54,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,404 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:55:54,406 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:55:54,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:54,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:54,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:54,423 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:54,428 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:55:54,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,430 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:55:54,430 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:55:54,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:54,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:54,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:54,444 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:54,450 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:55:54,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,452 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:55:54,453 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:55:54,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:54,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:54,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:54,467 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:54,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:54,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,475 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:55:54,476 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:55:54,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:54,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:54,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:54,490 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:54,496 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:55:54,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,498 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:55:54,499 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:55:54,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:54,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:54,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:54,514 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:54,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:54,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,522 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:55:54,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:54,532 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:55:54,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:54,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:54,547 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:54,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:54,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,554 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:55:54,555 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:55:54,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:54,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:54,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:54,570 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:54,575 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:55:54,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,578 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:55:54,579 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:55:54,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:54,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:54,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:54,594 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:54,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:55:54,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,601 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:55:54,602 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:55:54,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:54,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:54,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:54,616 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:54,621 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:55:54,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,623 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:55:54,625 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:55:54,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:54,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:54,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:54,642 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:54,650 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:55:54,650 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:55:54,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,653 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:55:54,654 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:55:54,654 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:54,670 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:55:54,670 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:54,670 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:54,671 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:55:54,676 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:55:54,677 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:54,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:55:54,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:55:54,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:54,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:54,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:54,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:54,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:54,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:54,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:54,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:54,752 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:55:54,752 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:55:54,753 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1080 states and 1566 transitions. cyclomatic complexity: 537 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (in total 25), 4 states have internal predecessors, (25), 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:55:54,790 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1080 states and 1566 transitions. cyclomatic complexity: 537. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (in total 25), 4 states have internal predecessors, (25), 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 2417 states and 3482 transitions. Complement of second has 5 states. [2025-04-26 16:55:54,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:55:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (in total 25), 4 states have internal predecessors, (25), 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:55:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-04-26 16:55:54,793 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 20 letters. Loop has 5 letters. [2025-04-26 16:55:54,793 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:54,793 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 25 letters. Loop has 5 letters. [2025-04-26 16:55:54,793 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:54,793 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 20 letters. Loop has 10 letters. [2025-04-26 16:55:54,793 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:54,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2417 states and 3482 transitions. [2025-04-26 16:55:54,806 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 16:55:54,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2417 states to 1761 states and 2548 transitions. [2025-04-26 16:55:54,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 726 [2025-04-26 16:55:54,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 780 [2025-04-26 16:55:54,815 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1761 states and 2548 transitions. [2025-04-26 16:55:54,815 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:54,815 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1761 states and 2548 transitions. [2025-04-26 16:55:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states and 2548 transitions. [2025-04-26 16:55:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1518. [2025-04-26 16:55:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1518 states have (on average 1.4749670619235837) internal successors, (in total 2239), 1517 states have internal predecessors, (2239), 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:55:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 2239 transitions. [2025-04-26 16:55:54,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1518 states and 2239 transitions. [2025-04-26 16:55:54,837 INFO L438 stractBuchiCegarLoop]: Abstraction has 1518 states and 2239 transitions. [2025-04-26 16:55:54,837 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:55:54,837 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1518 states and 2239 transitions. [2025-04-26 16:55:54,841 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 16:55:54,842 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:54,842 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:54,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:54,843 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:55:54,843 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:55:54,843 INFO L754 eck$LassoCheckResult]: Loop: "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:54,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1693929302, now seen corresponding path program 2 times [2025-04-26 16:55:54,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393036946] [2025-04-26 16:55:54,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:54,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:55:54,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:55:54,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:54,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,852 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:54,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:55:54,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:55:54,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:54,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,861 INFO L85 PathProgramCache]: Analyzing trace with hash 84370301, now seen corresponding path program 3 times [2025-04-26 16:55:54,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431499718] [2025-04-26 16:55:54,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:54,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:54,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:54,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:54,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,864 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:54,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:54,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:54,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:54,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,868 INFO L85 PathProgramCache]: Analyzing trace with hash 830021394, now seen corresponding path program 2 times [2025-04-26 16:55:54,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980790526] [2025-04-26 16:55:54,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:54,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:54,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:54,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:54,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:54,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:55:54,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:55:54,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:55,132 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:55,132 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:55,132 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:55,132 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:55,132 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:55,132 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,132 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:55,132 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:55,132 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:55:55,132 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:55,132 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:55,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,328 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:55,328 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:55,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,330 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:55:55,330 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:55:55,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:55,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:55,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:55,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:55,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:55,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:55,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:55,345 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:55,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:55:55,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,352 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:55:55,353 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:55:55,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:55,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:55,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:55,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:55,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:55,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:55,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:55,366 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:55,371 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:55:55,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,373 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:55:55,374 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:55:55,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:55:55,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:55,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:55,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:55,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:55,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:55,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:55,387 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:55,392 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:55:55,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,393 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:55:55,394 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:55:55,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:55,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:55,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:55,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:55,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:55,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:55,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:55,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:55,419 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:55:55,419 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:55:55,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,421 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:55:55,423 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:55:55,424 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:55,441 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:55:55,441 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:55,441 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:55,441 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:55:55,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:55:55,459 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:55:55,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:55:55,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:55:55,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:55,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:55,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:55,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:55,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:55,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:55,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:55,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:55,523 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:55:55,523 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:55:55,523 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1518 states and 2239 transitions. cyclomatic complexity: 814 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 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:55:55,554 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1518 states and 2239 transitions. cyclomatic complexity: 814. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 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 2331 states and 3551 transitions. Complement of second has 4 states. [2025-04-26 16:55:55,554 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:55:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 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:55:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-04-26 16:55:55,555 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 22 letters. Loop has 6 letters. [2025-04-26 16:55:55,555 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,555 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 28 letters. Loop has 6 letters. [2025-04-26 16:55:55,555 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,555 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 22 letters. Loop has 12 letters. [2025-04-26 16:55:55,556 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2331 states and 3551 transitions. [2025-04-26 16:55:55,565 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 16:55:55,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2331 states to 1695 states and 2511 transitions. [2025-04-26 16:55:55,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 505 [2025-04-26 16:55:55,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 579 [2025-04-26 16:55:55,573 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1695 states and 2511 transitions. [2025-04-26 16:55:55,573 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:55,573 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1695 states and 2511 transitions. [2025-04-26 16:55:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states and 2511 transitions. [2025-04-26 16:55:55,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1223. [2025-04-26 16:55:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1223 states have (on average 1.5110384300899429) internal successors, (in total 1848), 1222 states have internal predecessors, (1848), 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:55:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1848 transitions. [2025-04-26 16:55:55,590 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1223 states and 1848 transitions. [2025-04-26 16:55:55,590 INFO L438 stractBuchiCegarLoop]: Abstraction has 1223 states and 1848 transitions. [2025-04-26 16:55:55,590 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:55:55,590 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1223 states and 1848 transitions. [2025-04-26 16:55:55,593 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 16:55:55,593 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:55,593 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:55,594 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:55,594 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:55,594 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[115] L52-1-->thread2FINAL: Formula: (not v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-04-26 16:55:55,594 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-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]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:55:55,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,595 INFO L85 PathProgramCache]: Analyzing trace with hash 153536800, now seen corresponding path program 1 times [2025-04-26 16:55:55,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:55,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758999542] [2025-04-26 16:55:55,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:55,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:55,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:55:55,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:55:55,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:55,678 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:55:55,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:55,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758999542] [2025-04-26 16:55:55,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758999542] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:55:55,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768858911] [2025-04-26 16:55:55,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:55,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:55:55,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,680 INFO L229 MonitoredProcess]: Starting monitored process 31 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:55:55,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-26 16:55:55,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:55:55,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:55:55,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:55,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:55:55,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:55,761 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:55:55,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:55:55,821 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-26 16:55:55,822 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:55:55,828 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:55:55,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768858911] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:55:55,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:55:55,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-04-26 16:55:55,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405114253] [2025-04-26 16:55:55,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:55:55,828 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:55,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,829 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 3 times [2025-04-26 16:55:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:55,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094622619] [2025-04-26 16:55:55,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:55,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:55,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:55,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:55,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:55,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:55,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:55,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:55,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:55,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 16:55:55,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-26 16:55:55,902 INFO L87 Difference]: Start difference. First operand 1223 states and 1848 transitions. cyclomatic complexity: 695 Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (in total 45), 7 states have internal predecessors, (45), 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:55:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:56,006 INFO L93 Difference]: Finished difference Result 2300 states and 3409 transitions. [2025-04-26 16:55:56,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2300 states and 3409 transitions. [2025-04-26 16:55:56,017 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 16:55:56,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2300 states to 2233 states and 3297 transitions. [2025-04-26 16:55:56,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 721 [2025-04-26 16:55:56,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 721 [2025-04-26 16:55:56,028 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2233 states and 3297 transitions. [2025-04-26 16:55:56,029 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:56,029 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2233 states and 3297 transitions. [2025-04-26 16:55:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states and 3297 transitions. [2025-04-26 16:55:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 1548. [2025-04-26 16:55:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1548 states have (on average 1.5161498708010337) internal successors, (in total 2347), 1547 states have internal predecessors, (2347), 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:55:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2347 transitions. [2025-04-26 16:55:56,064 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1548 states and 2347 transitions. [2025-04-26 16:55:56,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:55:56,064 INFO L438 stractBuchiCegarLoop]: Abstraction has 1548 states and 2347 transitions. [2025-04-26 16:55:56,064 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:55:56,065 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1548 states and 2347 transitions. [2025-04-26 16:55:56,070 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 16:55:56,070 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:56,070 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:56,071 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:56,071 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:56,072 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[111] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[115] L52-1-->thread2FINAL: Formula: (not v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-04-26 16:55:56,072 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-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]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:55:56,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash 899521705, now seen corresponding path program 2 times [2025-04-26 16:55:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:56,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025728878] [2025-04-26 16:55:56,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:56,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:56,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-26 16:55:56,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 32 statements. [2025-04-26 16:55:56,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:56,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:56,136 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:55:56,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:56,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025728878] [2025-04-26 16:55:56,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025728878] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:56,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:56,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:55:56,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277687127] [2025-04-26 16:55:56,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:56,136 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:56,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:56,137 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 4 times [2025-04-26 16:55:56,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:56,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318597181] [2025-04-26 16:55:56,137 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:55:56,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:56,139 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-04-26 16:55:56,140 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:56,140 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:55:56,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:56,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:56,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:56,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:56,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:56,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:56,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:56,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:56,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:55:56,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:55:56,202 INFO L87 Difference]: Start difference. First operand 1548 states and 2347 transitions. cyclomatic complexity: 892 Second operand has 5 states, 5 states have (on average 5.6) internal successors, (in total 28), 4 states have internal predecessors, (28), 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:55:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:56,233 INFO L93 Difference]: Finished difference Result 1577 states and 2378 transitions. [2025-04-26 16:55:56,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1577 states and 2378 transitions. [2025-04-26 16:55:56,238 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 16:55:56,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1577 states to 1559 states and 2360 transitions. [2025-04-26 16:55:56,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 495 [2025-04-26 16:55:56,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 495 [2025-04-26 16:55:56,245 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1559 states and 2360 transitions. [2025-04-26 16:55:56,245 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:56,245 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1559 states and 2360 transitions. [2025-04-26 16:55:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states and 2360 transitions. [2025-04-26 16:55:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1548. [2025-04-26 16:55:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1548 states have (on average 1.5155038759689923) internal successors, (in total 2346), 1547 states have internal predecessors, (2346), 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:55:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2346 transitions. [2025-04-26 16:55:56,266 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1548 states and 2346 transitions. [2025-04-26 16:55:56,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:55:56,267 INFO L438 stractBuchiCegarLoop]: Abstraction has 1548 states and 2346 transitions. [2025-04-26 16:55:56,267 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:55:56,267 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1548 states and 2346 transitions. [2025-04-26 16:55:56,271 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 16:55:56,272 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:56,272 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:56,273 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:56,273 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:56,274 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[115] L52-1-->thread2FINAL: Formula: (not v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-04-26 16:55:56,274 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-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]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:55:56,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:56,274 INFO L85 PathProgramCache]: Analyzing trace with hash 799351218, now seen corresponding path program 2 times [2025-04-26 16:55:56,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:56,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555095445] [2025-04-26 16:55:56,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:56,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:56,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-26 16:55:56,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:55:56,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:56,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:56,556 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:55:56,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:56,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555095445] [2025-04-26 16:55:56,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555095445] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:55:56,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422937677] [2025-04-26 16:55:56,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:56,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:55:56,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:56,559 INFO L229 MonitoredProcess]: Starting monitored process 32 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:55:56,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-26 16:55:56,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-26 16:55:56,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:55:56,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:56,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:56,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:55:56,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:56,667 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:55:56,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:55:56,706 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-26 16:55:56,707 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 15 treesize of output 14 [2025-04-26 16:55:56,718 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:55:56,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422937677] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:55:56,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:55:56,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-04-26 16:55:56,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40779128] [2025-04-26 16:55:56,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:55:56,718 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:56,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 5 times [2025-04-26 16:55:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:56,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931575009] [2025-04-26 16:55:56,719 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:55:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:56,721 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:56,722 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:56,722 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:56,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:56,722 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:56,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:56,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:56,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:56,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:56,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:56,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:56,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-26 16:55:56,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-26 16:55:56,776 INFO L87 Difference]: Start difference. First operand 1548 states and 2346 transitions. cyclomatic complexity: 891 Second operand has 15 states, 14 states have (on average 5.428571428571429) internal successors, (in total 76), 14 states have internal predecessors, (76), 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:55:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:56,934 INFO L93 Difference]: Finished difference Result 3151 states and 4687 transitions. [2025-04-26 16:55:56,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3151 states and 4687 transitions. [2025-04-26 16:55:56,943 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 16:55:56,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3151 states to 3082 states and 4551 transitions. [2025-04-26 16:55:56,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 924 [2025-04-26 16:55:56,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 924 [2025-04-26 16:55:56,956 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3082 states and 4551 transitions. [2025-04-26 16:55:56,956 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:56,956 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3082 states and 4551 transitions. [2025-04-26 16:55:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states and 4551 transitions. [2025-04-26 16:55:56,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 2323. [2025-04-26 16:55:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2323 states, 2323 states have (on average 1.5101162290142058) internal successors, (in total 3508), 2322 states have internal predecessors, (3508), 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:55:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3508 transitions. [2025-04-26 16:55:56,990 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2323 states and 3508 transitions. [2025-04-26 16:55:56,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-26 16:55:56,991 INFO L438 stractBuchiCegarLoop]: Abstraction has 2323 states and 3508 transitions. [2025-04-26 16:55:56,991 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:55:56,991 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2323 states and 3508 transitions. [2025-04-26 16:55:56,995 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 16:55:56,995 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:56,995 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:56,996 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:56,996 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:56,996 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[115] L52-1-->thread2FINAL: Formula: (not v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-04-26 16:55:56,996 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-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]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:55:56,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:56,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1272836468, now seen corresponding path program 3 times [2025-04-26 16:55:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:56,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986747249] [2025-04-26 16:55:56,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:56,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-04-26 16:55:57,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-26 16:55:57,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:55:57,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:57,091 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:55:57,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:57,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986747249] [2025-04-26 16:55:57,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986747249] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:57,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:57,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:55:57,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102078573] [2025-04-26 16:55:57,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:57,092 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:57,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:57,092 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 6 times [2025-04-26 16:55:57,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:57,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775344279] [2025-04-26 16:55:57,092 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:55:57,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:57,094 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:57,095 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:57,095 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:55:57,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:57,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:57,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:57,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:57,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:57,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:57,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:57,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:57,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:55:57,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:55:57,152 INFO L87 Difference]: Start difference. First operand 2323 states and 3508 transitions. cyclomatic complexity: 1332 Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (in total 35), 5 states have internal predecessors, (35), 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:55:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:57,187 INFO L93 Difference]: Finished difference Result 2429 states and 3632 transitions. [2025-04-26 16:55:57,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2429 states and 3632 transitions. [2025-04-26 16:55:57,193 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 16:55:57,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2429 states to 2358 states and 3556 transitions. [2025-04-26 16:55:57,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 672 [2025-04-26 16:55:57,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 672 [2025-04-26 16:55:57,202 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2358 states and 3556 transitions. [2025-04-26 16:55:57,202 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:57,202 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2358 states and 3556 transitions. [2025-04-26 16:55:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states and 3556 transitions. [2025-04-26 16:55:57,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2330. [2025-04-26 16:55:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 2330 states have (on average 1.5090128755364807) internal successors, (in total 3516), 2329 states have internal predecessors, (3516), 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:55:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3516 transitions. [2025-04-26 16:55:57,231 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2330 states and 3516 transitions. [2025-04-26 16:55:57,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:55:57,232 INFO L438 stractBuchiCegarLoop]: Abstraction has 2330 states and 3516 transitions. [2025-04-26 16:55:57,232 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:55:57,232 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2330 states and 3516 transitions. [2025-04-26 16:55:57,236 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 16:55:57,236 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:57,236 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:57,237 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:57,237 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:57,237 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[115] L52-1-->thread2FINAL: Formula: (not v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-04-26 16:55:57,237 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-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]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:55:57,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:57,238 INFO L85 PathProgramCache]: Analyzing trace with hash -242194312, now seen corresponding path program 4 times [2025-04-26 16:55:57,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:57,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859370120] [2025-04-26 16:55:57,238 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:55:57,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:57,240 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-26 16:55:57,246 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 16:55:57,246 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:55:57,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:57,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:57,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 16:55:57,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 16:55:57,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:57,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:57,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:57,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:57,253 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 7 times [2025-04-26 16:55:57,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:57,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537438446] [2025-04-26 16:55:57,253 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:55:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:57,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:57,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:57,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:57,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:57,255 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:57,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:57,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:57,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:57,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:57,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:57,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:57,258 INFO L85 PathProgramCache]: Analyzing trace with hash -731785208, now seen corresponding path program 1 times [2025-04-26 16:55:57,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:57,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856199735] [2025-04-26 16:55:57,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:57,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:57,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-26 16:55:57,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-26 16:55:57,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:57,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:57,266 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:57,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-26 16:55:57,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-26 16:55:57,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:57,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:57,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:57,771 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:57,771 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:57,771 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:57,771 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:57,771 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:57,771 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:57,771 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:57,771 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:57,771 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration11_Lasso [2025-04-26 16:55:57,772 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:57,772 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:57,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:57,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:57,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:57,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:57,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:57,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:57,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:57,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:57,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:57,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:57,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:57,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:58,186 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:58,186 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:58,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:58,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:58,188 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:55:58,189 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:55:58,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:58,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:58,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:58,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:58,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:58,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:58,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:58,203 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:58,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:58,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:58,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:58,210 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:55:58,211 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:55:58,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:58,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:58,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:58,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:58,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:58,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:58,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:58,232 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:58,237 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:55:58,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:58,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:58,239 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:55:58,240 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:55:58,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:55:58,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:58,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:58,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:58,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:58,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:58,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:58,256 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:58,262 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:55:58,263 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:55:58,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:58,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:58,265 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:55:58,266 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:55:58,266 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:58,282 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:55:58,283 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:58,283 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:58,283 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2025-04-26 16:55:58,288 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:55:58,301 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-04-26 16:55:58,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:58,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 16:55:58,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 16:55:58,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:58,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:58,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:58,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:58,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:58,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:58,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:58,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:58,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:58,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:58,386 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:55:58,386 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:55:58,386 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2330 states and 3516 transitions. cyclomatic complexity: 1333 Second operand has 4 states, 4 states have (on average 7.0) internal successors, (in total 28), 4 states have internal predecessors, (28), 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:55:58,418 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2330 states and 3516 transitions. cyclomatic complexity: 1333. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (in total 28), 4 states have internal predecessors, (28), 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 2468 states and 3721 transitions. Complement of second has 4 states. [2025-04-26 16:55:58,418 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:55:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (in total 28), 4 states have internal predecessors, (28), 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:55:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-04-26 16:55:58,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 59 transitions. Stem has 39 letters. Loop has 5 letters. [2025-04-26 16:55:58,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:58,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 59 transitions. Stem has 44 letters. Loop has 5 letters. [2025-04-26 16:55:58,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:58,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 59 transitions. Stem has 39 letters. Loop has 10 letters. [2025-04-26 16:55:58,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:58,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2468 states and 3721 transitions. [2025-04-26 16:55:58,428 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:58,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2468 states to 0 states and 0 transitions. [2025-04-26 16:55:58,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:58,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:58,429 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:58,429 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:58,429 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:58,429 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:58,429 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:58,429 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 16:55:58,429 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:55:58,429 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:58,429 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:55:58,439 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:55:58,440 INFO L201 PluginConnector]: Adding new model queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:58 BoogieIcfgContainer [2025-04-26 16:55:58,440 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:58,441 INFO L158 Benchmark]: Toolchain (without parser) took 8276.97ms. Allocated memory was 159.4MB in the beginning and 234.9MB in the end (delta: 75.5MB). Free memory was 87.4MB in the beginning and 167.2MB in the end (delta: -79.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:58,441 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.06ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:58,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.24ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 85.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:58,441 INFO L158 Benchmark]: Boogie Preprocessor took 38.02ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 84.4MB in the end (delta: 906.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:58,441 INFO L158 Benchmark]: RCFGBuilder took 239.75ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 73.4MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:55:58,442 INFO L158 Benchmark]: BuchiAutomizer took 7943.18ms. Allocated memory was 159.4MB in the beginning and 234.9MB in the end (delta: 75.5MB). Free memory was 73.1MB in the beginning and 167.2MB in the end (delta: -94.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:58,444 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 1.06ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.24ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 85.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 38.02ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 84.4MB in the end (delta: 906.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 239.75ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 73.4MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 7943.18ms. Allocated memory was 159.4MB in the beginning and 234.9MB in the end (delta: 75.5MB). Free memory was 73.1MB in the beginning and 167.2MB in the end (delta: -94.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 5.7s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 2704 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, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 740 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 734 mSDsluCounter, 1078 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 670 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 603 IncrementalHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 408 mSDtfsCounter, 603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp57 ukn91 mio100 lsp62 div100 bol108 ite100 ukn100 eq190 hnf91 smp100 dnf205 smp78 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 82ms 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]: 379, Number of transitions in reduction automaton: 1068, Number of states in reduction automaton: 740, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (5 trivial, 6 deterministic, 0 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 q2_back + -1 * q2_front 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. 5 modules have a trivial ranking function, the largest among these consists of 15 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:55:58,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-26 16:55:58,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-26 16:55:58,858 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...