/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/prod-cons3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:09,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:09,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:09,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:09,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:09,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:09,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:09,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:09,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:09,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:09,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:09,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:09,121 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:09,121 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:09,121 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:09,121 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:09,121 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:09,121 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:09,121 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:09,121 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:09,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:09,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:09,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:09,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:09,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:09,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:09,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:09,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:09,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:09,122 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:09,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:09,122 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:09,122 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:09,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:09,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:09,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:09,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:09,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:09,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:09,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:09,125 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:09,125 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:09,125 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:09,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:09,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:09,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:09,368 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:09,369 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:09,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl [2025-04-26 16:56:09,371 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl' [2025-04-26 16:56:09,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:09,395 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:09,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:09,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:09,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:09,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,428 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:09,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:09,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:09,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:09,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:09,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:09,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:09,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:09,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:09,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/1) ... [2025-04-26 16:56:09,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:09,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:09,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:09,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:09,501 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:09,501 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:09,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:09,501 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:09,501 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:09,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:09,501 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:09,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:09,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:09,502 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:56:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:56:09,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:56:09,502 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:56:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:56:09,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:56:09,502 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:56:09,545 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:09,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:09,672 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:09,672 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:09,694 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:09,695 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:09,695 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:09 BoogieIcfgContainer [2025-04-26 16:56:09,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:09,697 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:09,697 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:09,701 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:09,702 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:09,702 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:09" (1/2) ... [2025-04-26 16:56:09,704 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5367e79 and model type prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:09, skipping insertion in model container [2025-04-26 16:56:09,705 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:09,705 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:09" (2/2) ... [2025-04-26 16:56:09,706 INFO L376 chiAutomizerObserver]: Analyzing ICFG prod-cons3.wvr.bpl [2025-04-26 16:56:09,764 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:56:09,804 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:09,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:09,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:09,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:09,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:09,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 116 flow [2025-04-26 16:56:09,891 INFO L116 PetriNetUnfolderBase]: 3/36 cut-off events. [2025-04-26 16:56:09,893 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:56:09,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 3/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-04-26 16:56:09,898 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 44 transitions, 116 flow [2025-04-26 16:56:09,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 36 transitions, 96 flow [2025-04-26 16:56:09,902 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 46 places, 36 transitions, 96 flow [2025-04-26 16:56:09,909 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:10,216 WARN L140 AmpleReduction]: Number of pruned transitions: 1093 [2025-04-26 16:56:10,216 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:10,218 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 104 [2025-04-26 16:56:10,218 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:71 [2025-04-26 16:56:10,218 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:436 [2025-04-26 16:56:10,218 WARN L145 AmpleReduction]: Times succ was already a loop node:79 [2025-04-26 16:56:10,218 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:168 [2025-04-26 16:56:10,218 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:10,223 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 612 states, 610 states have (on average 1.8) internal successors, (in total 1098), 611 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:10,234 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:10,234 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:10,234 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:10,234 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:10,234 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:10,234 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:10,234 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:10,234 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:10,237 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 612 states, 610 states have (on average 1.8) internal successors, (in total 1098), 611 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:10,299 INFO L131 ngComponentsAnalysis]: Automaton has 71 accepting balls. 494 [2025-04-26 16:56:10,299 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:10,299 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:10,305 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:10,306 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:10,306 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:10,307 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 612 states, 610 states have (on average 1.8) internal successors, (in total 1098), 611 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:10,318 INFO L131 ngComponentsAnalysis]: Automaton has 71 accepting balls. 494 [2025-04-26 16:56:10,318 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:10,318 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:10,318 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:10,318 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:10,324 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:10,324 INFO L754 eck$LassoCheckResult]: Loop: "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" [2025-04-26 16:56:10,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:10,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1102579250, now seen corresponding path program 1 times [2025-04-26 16:56:10,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:10,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439565406] [2025-04-26 16:56:10,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:10,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:10,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:10,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:10,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:10,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:10,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:10,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:10,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:10,441 INFO L85 PathProgramCache]: Analyzing trace with hash 123198, now seen corresponding path program 1 times [2025-04-26 16:56:10,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:10,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738143565] [2025-04-26 16:56:10,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:10,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:10,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:10,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:10,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:10,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:10,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:10,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:10,463 INFO L85 PathProgramCache]: Analyzing trace with hash 971536465, now seen corresponding path program 1 times [2025-04-26 16:56:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:10,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460100354] [2025-04-26 16:56:10,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:10,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:10,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:10,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,473 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:10,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:10,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:10,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:10,660 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:10,661 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:10,661 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:10,661 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:10,661 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:10,662 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,662 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:10,662 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:10,662 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:56:10,662 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:10,662 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:10,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,829 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:10,831 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:10,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,837 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:10,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:10,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:10,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:10,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:10,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:10,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:10,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:10,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:10,863 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:10,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:10,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:10,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:10,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:10,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:10,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:10,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:10,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:10,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:10,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:10,900 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:10,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:10,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:10,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:56:10,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:10,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:10,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:10,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:10,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:10,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:10,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:10,927 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:10,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:56:10,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,935 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:10,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:56:10,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:10,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:10,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:10,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:10,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:10,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:10,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:10,959 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:10,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:10,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,967 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:10,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:56:10,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:10,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:10,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:10,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:10,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:10,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:10,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:10,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:10,984 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:10,990 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:56:10,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,992 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:10,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:56:10,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:11,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:11,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:11,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:11,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:11,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:11,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:11,013 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:11,023 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:56:11,023 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:56:11,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,044 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:11,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:56:11,048 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:11,065 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:56:11,065 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:11,065 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:11,066 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w) = 1*w Supporting invariants [] [2025-04-26 16:56:11,072 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:56:11,074 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:11,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:11,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:11,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:11,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:11,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:11,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:11,165 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:11,167 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 612 states, 610 states have (on average 1.8) internal successors, (in total 1098), 611 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:11,285 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 612 states, 610 states have (on average 1.8) internal successors, (in total 1098), 611 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 1506 states and 3044 transitions. Complement of second has 7 states. [2025-04-26 16:56:11,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-04-26 16:56:11,292 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:56:11,293 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,293 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 16:56:11,293 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,293 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 7 letters. Loop has 6 letters. [2025-04-26 16:56:11,293 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1506 states and 3044 transitions. [2025-04-26 16:56:11,307 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 258 [2025-04-26 16:56:11,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1506 states to 827 states and 1661 transitions. [2025-04-26 16:56:11,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 353 [2025-04-26 16:56:11,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 508 [2025-04-26 16:56:11,320 INFO L74 IsDeterministic]: Start isDeterministic. Operand 827 states and 1661 transitions. [2025-04-26 16:56:11,321 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:11,321 INFO L218 hiAutomatonCegarLoop]: Abstraction has 827 states and 1661 transitions. [2025-04-26 16:56:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states and 1661 transitions. [2025-04-26 16:56:11,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 686. [2025-04-26 16:56:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 686 states have (on average 2.0335276967930027) internal successors, (in total 1395), 685 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1395 transitions. [2025-04-26 16:56:11,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 686 states and 1395 transitions. [2025-04-26 16:56:11,368 INFO L438 stractBuchiCegarLoop]: Abstraction has 686 states and 1395 transitions. [2025-04-26 16:56:11,368 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:11,368 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 686 states and 1395 transitions. [2025-04-26 16:56:11,372 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 258 [2025-04-26 16:56:11,372 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:11,372 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:11,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:11,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:11,372 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: 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]" [2025-04-26 16:56:11,373 INFO L754 eck$LassoCheckResult]: Loop: "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" [2025-04-26 16:56:11,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,373 INFO L85 PathProgramCache]: Analyzing trace with hash 179781734, now seen corresponding path program 1 times [2025-04-26 16:56:11,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780346343] [2025-04-26 16:56:11,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:11,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:11,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:11,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:11,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash 3973156, now seen corresponding path program 1 times [2025-04-26 16:56:11,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032331984] [2025-04-26 16:56:11,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:11,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:11,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,389 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:11,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:11,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1659053577, now seen corresponding path program 1 times [2025-04-26 16:56:11,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240261155] [2025-04-26 16:56:11,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:11,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:11,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:11,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240261155] [2025-04-26 16:56:11,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240261155] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:11,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:11,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:11,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181607272] [2025-04-26 16:56:11,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:11,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:11,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:11,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:11,532 INFO L87 Difference]: Start difference. First operand 686 states and 1395 transitions. cyclomatic complexity: 777 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:11,590 INFO L93 Difference]: Finished difference Result 961 states and 1852 transitions. [2025-04-26 16:56:11,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 961 states and 1852 transitions. [2025-04-26 16:56:11,596 INFO L131 ngComponentsAnalysis]: Automaton has 73 accepting balls. 330 [2025-04-26 16:56:11,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 961 states to 905 states and 1777 transitions. [2025-04-26 16:56:11,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 497 [2025-04-26 16:56:11,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 497 [2025-04-26 16:56:11,606 INFO L74 IsDeterministic]: Start isDeterministic. Operand 905 states and 1777 transitions. [2025-04-26 16:56:11,606 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:11,606 INFO L218 hiAutomatonCegarLoop]: Abstraction has 905 states and 1777 transitions. [2025-04-26 16:56:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states and 1777 transitions. [2025-04-26 16:56:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 759. [2025-04-26 16:56:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 759 states have (on average 2.0790513833992095) internal successors, (in total 1578), 758 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1578 transitions. [2025-04-26 16:56:11,629 INFO L240 hiAutomatonCegarLoop]: Abstraction has 759 states and 1578 transitions. [2025-04-26 16:56:11,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:11,630 INFO L438 stractBuchiCegarLoop]: Abstraction has 759 states and 1578 transitions. [2025-04-26 16:56:11,630 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:11,630 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 759 states and 1578 transitions. [2025-04-26 16:56:11,633 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 276 [2025-04-26 16:56:11,634 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:11,634 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:11,634 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:11,634 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:11,634 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: 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]" "[119] L81-->L55: 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]" [2025-04-26 16:56:11,635 INFO L754 eck$LassoCheckResult]: Loop: "[105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[]" "[107] L56-->L56-1: Formula: (and (= (+ v_front2_11 1) v_front2_10) (< v_front2_11 v_back2_10) (= v_temp2_5 (select v_queue2_7 v_front2_11))) InVars {front2=v_front2_11, queue2=v_queue2_7, back2=v_back2_10} OutVars{front2=v_front2_10, queue2=v_queue2_7, back2=v_back2_10, temp2=v_temp2_5} AuxVars[] AssignedVars[temp2, front2]" "[108] L56-1-->L55: Formula: (= v_d2_2 (+ v_temp2_2 v_d2_3)) InVars {d2=v_d2_3, temp2=v_temp2_2} OutVars{d2=v_d2_2, temp2=v_temp2_2} AuxVars[] AssignedVars[d2]" [2025-04-26 16:56:11,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1278266577, now seen corresponding path program 1 times [2025-04-26 16:56:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974021419] [2025-04-26 16:56:11,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:11,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:11,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:11,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:11,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,652 INFO L85 PathProgramCache]: Analyzing trace with hash 134121, now seen corresponding path program 1 times [2025-04-26 16:56:11,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174083693] [2025-04-26 16:56:11,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1659653401, now seen corresponding path program 1 times [2025-04-26 16:56:11,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126122544] [2025-04-26 16:56:11,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:11,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:11,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:11,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:11,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126122544] [2025-04-26 16:56:11,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126122544] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:11,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:11,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:11,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38881819] [2025-04-26 16:56:11,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:11,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:11,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:11,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:11,734 INFO L87 Difference]: Start difference. First operand 759 states and 1578 transitions. cyclomatic complexity: 897 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:11,765 INFO L93 Difference]: Finished difference Result 1133 states and 2270 transitions. [2025-04-26 16:56:11,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1133 states and 2270 transitions. [2025-04-26 16:56:11,772 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 258 [2025-04-26 16:56:11,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1133 states to 1002 states and 2030 transitions. [2025-04-26 16:56:11,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 507 [2025-04-26 16:56:11,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 507 [2025-04-26 16:56:11,781 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1002 states and 2030 transitions. [2025-04-26 16:56:11,781 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:11,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1002 states and 2030 transitions. [2025-04-26 16:56:11,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states and 2030 transitions. [2025-04-26 16:56:11,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 825. [2025-04-26 16:56:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 825 states have (on average 2.124848484848485) internal successors, (in total 1753), 824 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1753 transitions. [2025-04-26 16:56:11,801 INFO L240 hiAutomatonCegarLoop]: Abstraction has 825 states and 1753 transitions. [2025-04-26 16:56:11,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:11,802 INFO L438 stractBuchiCegarLoop]: Abstraction has 825 states and 1753 transitions. [2025-04-26 16:56:11,802 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:11,802 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 825 states and 1753 transitions. [2025-04-26 16:56:11,806 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 258 [2025-04-26 16:56:11,806 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:11,806 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:11,807 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:11,807 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:11,807 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: 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]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" [2025-04-26 16:56:11,807 INFO L754 eck$LassoCheckResult]: Loop: "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" [2025-04-26 16:56:11,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash -109161053, now seen corresponding path program 1 times [2025-04-26 16:56:11,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641008662] [2025-04-26 16:56:11,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:11,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:11,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:11,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:11,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 4064356, now seen corresponding path program 2 times [2025-04-26 16:56:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234083288] [2025-04-26 16:56:11,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:11,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:11,833 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:11,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:11,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,833 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:11,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:11,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1049315066, now seen corresponding path program 1 times [2025-04-26 16:56:11,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939977459] [2025-04-26 16:56:11,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:56:11,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:56:11,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:11,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:11,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939977459] [2025-04-26 16:56:11,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939977459] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:56:11,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697825268] [2025-04-26 16:56:11,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:56:11,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,921 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:56:11,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-26 16:56:11,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:56:11,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:56:11,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:11,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-26 16:56:11,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:56:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-26 16:56:12,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697825268] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:56:12,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:56:12,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-04-26 16:56:12,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383802295] [2025-04-26 16:56:12,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:56:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:12,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:56:12,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:56:12,097 INFO L87 Difference]: Start difference. First operand 825 states and 1753 transitions. cyclomatic complexity: 1018 Second operand has 5 states, 4 states have (on average 5.75) internal successors, (in total 23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:12,158 INFO L93 Difference]: Finished difference Result 2007 states and 4047 transitions. [2025-04-26 16:56:12,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2007 states and 4047 transitions. [2025-04-26 16:56:12,197 INFO L131 ngComponentsAnalysis]: Automaton has 97 accepting balls. 402 [2025-04-26 16:56:12,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2007 states to 1827 states and 3728 transitions. [2025-04-26 16:56:12,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 847 [2025-04-26 16:56:12,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 847 [2025-04-26 16:56:12,215 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1827 states and 3728 transitions. [2025-04-26 16:56:12,215 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:12,215 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1827 states and 3728 transitions. [2025-04-26 16:56:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states and 3728 transitions. [2025-04-26 16:56:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1440. [2025-04-26 16:56:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1440 states have (on average 2.182638888888889) internal successors, (in total 3143), 1439 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 3143 transitions. [2025-04-26 16:56:12,256 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1440 states and 3143 transitions. [2025-04-26 16:56:12,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:56:12,257 INFO L438 stractBuchiCegarLoop]: Abstraction has 1440 states and 3143 transitions. [2025-04-26 16:56:12,257 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:12,257 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1440 states and 3143 transitions. [2025-04-26 16:56:12,264 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 294 [2025-04-26 16:56:12,265 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:12,265 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:12,265 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:12,265 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:12,266 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: 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]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[119] L81-->L55: 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]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" [2025-04-26 16:56:12,266 INFO L754 eck$LassoCheckResult]: Loop: "[105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[]" "[107] L56-->L56-1: Formula: (and (= (+ v_front2_11 1) v_front2_10) (< v_front2_11 v_back2_10) (= v_temp2_5 (select v_queue2_7 v_front2_11))) InVars {front2=v_front2_11, queue2=v_queue2_7, back2=v_back2_10} OutVars{front2=v_front2_10, queue2=v_queue2_7, back2=v_back2_10, temp2=v_temp2_5} AuxVars[] AssignedVars[temp2, front2]" "[108] L56-1-->L55: Formula: (= v_d2_2 (+ v_temp2_2 v_d2_3)) InVars {d2=v_d2_3, temp2=v_temp2_2} OutVars{d2=v_d2_2, temp2=v_temp2_2} AuxVars[] AssignedVars[d2]" [2025-04-26 16:56:12,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,266 INFO L85 PathProgramCache]: Analyzing trace with hash -72131967, now seen corresponding path program 1 times [2025-04-26 16:56:12,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442788480] [2025-04-26 16:56:12,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:12,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:56:12,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:56:12,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:56:12,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:56:12,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash 134121, now seen corresponding path program 2 times [2025-04-26 16:56:12,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654337758] [2025-04-26 16:56:12,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:12,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:12,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:12,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:12,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,291 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:12,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:12,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1399676567, now seen corresponding path program 1 times [2025-04-26 16:56:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:12,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071348400] [2025-04-26 16:56:12,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:12,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:12,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:12,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:12,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:12,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:12,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:12,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:12,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,567 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:12,567 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:12,567 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:12,567 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:12,567 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:12,567 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,567 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:12,567 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:12,567 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:56:12,567 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:12,567 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:12,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,840 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:12,841 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:12,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,844 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:12,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:56:12,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:12,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,864 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:12,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:56:12,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,872 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:12,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:56:12,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:12,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,892 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:12,902 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:56:12,902 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:56:12,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,904 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:12,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:56:12,906 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:12,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:56:12,923 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:12,923 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:12,923 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(back2, front2) = 1*back2 - 1*front2 Supporting invariants [] [2025-04-26 16:56:12,929 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:56:12,933 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:12,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:56:12,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:56:12,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:12,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:12,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:12,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:12,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:12,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:13,008 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:13,008 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1440 states and 3143 transitions. cyclomatic complexity: 1810 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:13,083 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1440 states and 3143 transitions. cyclomatic complexity: 1810. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 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 4412 states and 9585 transitions. Complement of second has 5 states. [2025-04-26 16:56:13,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-26 16:56:13,084 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 16 letters. Loop has 3 letters. [2025-04-26 16:56:13,085 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:13,085 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 19 letters. Loop has 3 letters. [2025-04-26 16:56:13,085 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:13,085 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 16 letters. Loop has 6 letters. [2025-04-26 16:56:13,085 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:13,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4412 states and 9585 transitions. [2025-04-26 16:56:13,128 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 294 [2025-04-26 16:56:13,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4412 states to 3196 states and 6759 transitions. [2025-04-26 16:56:13,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1262 [2025-04-26 16:56:13,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2025-04-26 16:56:13,155 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3196 states and 6759 transitions. [2025-04-26 16:56:13,155 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:13,155 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3196 states and 6759 transitions. [2025-04-26 16:56:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states and 6759 transitions. [2025-04-26 16:56:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 2330. [2025-04-26 16:56:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 2330 states have (on average 2.296137339055794) internal successors, (in total 5350), 2329 states have internal predecessors, (5350), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 5350 transitions. [2025-04-26 16:56:13,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2330 states and 5350 transitions. [2025-04-26 16:56:13,221 INFO L438 stractBuchiCegarLoop]: Abstraction has 2330 states and 5350 transitions. [2025-04-26 16:56:13,221 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:56:13,221 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2330 states and 5350 transitions. [2025-04-26 16:56:13,233 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 294 [2025-04-26 16:56:13,234 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:13,234 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:13,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:13,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:13,235 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: 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]" "[119] L81-->L55: 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]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[104] L55-->thread3FINAL: Formula: (not v_v_assert_8) InVars {v_assert=v_v_assert_8} OutVars{v_assert=v_v_assert_8} AuxVars[] AssignedVars[]" "[106] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:56:13,235 INFO L754 eck$LassoCheckResult]: Loop: "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" [2025-04-26 16:56:13,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1449652339, now seen corresponding path program 1 times [2025-04-26 16:56:13,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020125972] [2025-04-26 16:56:13,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:13,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:56:13,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:56:13,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-26 16:56:13,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:13,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020125972] [2025-04-26 16:56:13,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020125972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:13,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:13,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:13,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839820293] [2025-04-26 16:56:13,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:13,265 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:13,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,265 INFO L85 PathProgramCache]: Analyzing trace with hash 3973156, now seen corresponding path program 3 times [2025-04-26 16:56:13,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130570446] [2025-04-26 16:56:13,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:56:13,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:13,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:13,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:56:13,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:13,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:13,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:13,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:13,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:13,317 INFO L87 Difference]: Start difference. First operand 2330 states and 5350 transitions. cyclomatic complexity: 3193 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:13,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:13,358 INFO L93 Difference]: Finished difference Result 2179 states and 4702 transitions. [2025-04-26 16:56:13,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2179 states and 4702 transitions. [2025-04-26 16:56:13,374 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 262 [2025-04-26 16:56:13,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2179 states to 2005 states and 4320 transitions. [2025-04-26 16:56:13,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 819 [2025-04-26 16:56:13,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 819 [2025-04-26 16:56:13,389 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2005 states and 4320 transitions. [2025-04-26 16:56:13,389 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:13,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2005 states and 4320 transitions. [2025-04-26 16:56:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states and 4320 transitions. [2025-04-26 16:56:13,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1806. [2025-04-26 16:56:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1806 states have (on average 2.2397563676633445) internal successors, (in total 4045), 1805 states have internal predecessors, (4045), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 4045 transitions. [2025-04-26 16:56:13,476 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1806 states and 4045 transitions. [2025-04-26 16:56:13,477 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:13,478 INFO L438 stractBuchiCegarLoop]: Abstraction has 1806 states and 4045 transitions. [2025-04-26 16:56:13,478 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:56:13,478 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1806 states and 4045 transitions. [2025-04-26 16:56:13,485 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 262 [2025-04-26 16:56:13,485 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:13,485 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:13,486 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:13,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:13,487 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: 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]" "[119] L81-->L55: 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]" "[122] L82-->$Ultimate##0: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[109] $Ultimate##0-->thread4FINAL: Formula: (let ((.cse0 (* 2 v_W_3))) (or (and (not v_v_assert_9) (< .cse0 v_d2_4)) (and (<= v_d2_4 .cse0) v_v_assert_9))) InVars {d2=v_d2_4, W=v_W_3} OutVars{d2=v_d2_4, v_assert=v_v_assert_9, W=v_W_3} AuxVars[] AssignedVars[v_assert]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[110] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[93] L26-->thread1FINAL: Formula: (or (not v_v_assert_2) (<= v_w_4 0)) InVars {v_assert=v_v_assert_2, w=v_w_4} OutVars{v_assert=v_v_assert_2, w=v_w_4} AuxVars[] AssignedVars[]" [2025-04-26 16:56:13,487 INFO L754 eck$LassoCheckResult]: Loop: "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" [2025-04-26 16:56:13,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,487 INFO L85 PathProgramCache]: Analyzing trace with hash -815817651, now seen corresponding path program 1 times [2025-04-26 16:56:13,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129633033] [2025-04-26 16:56:13,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:13,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:13,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:13,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,499 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:13,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:13,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,504 INFO L85 PathProgramCache]: Analyzing trace with hash 3973156, now seen corresponding path program 4 times [2025-04-26 16:56:13,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332912058] [2025-04-26 16:56:13,504 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:56:13,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,507 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-04-26 16:56:13,508 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:13,508 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:56:13,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:13,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:13,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1566755216, now seen corresponding path program 1 times [2025-04-26 16:56:13,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:13,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566986335] [2025-04-26 16:56:13,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:13,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:13,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:13,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,516 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:13,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:13,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:13,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:13,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:13,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:13,789 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:13,790 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:13,790 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:13,790 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:13,790 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:13,790 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:13,790 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:13,790 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:13,790 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:56:13,790 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:13,790 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:13,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:13,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:14,016 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:14,016 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:14,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,020 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:56:14,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,038 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:56:14,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,046 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:56:14,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,065 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:56:14,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,073 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:56:14,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,092 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:56:14,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,100 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:56:14,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,118 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:56:14,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,127 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:56:14,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,147 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:56:14,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,153 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:56:14,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,173 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:56:14,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,183 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:56:14,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,198 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,204 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:56:14,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,206 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:56:14,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,222 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:14,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,230 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:56:14,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,244 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,250 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:56:14,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,252 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:56:14,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,270 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:56:14,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,278 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:56:14,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,295 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:56:14,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,303 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:56:14,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,319 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:14,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,328 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:56:14,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,344 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,351 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:56:14,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,356 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:56:14,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,374 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:14,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,382 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:56:14,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,400 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:56:14,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,407 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:56:14,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,424 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:14,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,431 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:56:14,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,453 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:14,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:56:14,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,462 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:56:14,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:14,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:14,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:14,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:14,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:14,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:14,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:14,486 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:14,498 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:56:14,498 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:56:14,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:14,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,503 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:56:14,504 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:14,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:14,521 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:14,521 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:14,521 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(back1, front1) = 1*back1 - 1*front1 Supporting invariants [] [2025-04-26 16:56:14,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:14,530 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:14,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:14,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:14,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:14,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:14,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:14,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:14,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:14,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:14,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:14,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:14,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:14,594 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:14,594 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1806 states and 4045 transitions. cyclomatic complexity: 2388 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:14,629 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1806 states and 4045 transitions. cyclomatic complexity: 2388. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2462 states and 5324 transitions. Complement of second has 4 states. [2025-04-26 16:56:14,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-04-26 16:56:14,630 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 16:56:14,630 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,630 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 16:56:14,630 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,631 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 19 letters. Loop has 8 letters. [2025-04-26 16:56:14,631 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:14,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2462 states and 5324 transitions. [2025-04-26 16:56:14,643 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 112 [2025-04-26 16:56:14,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2462 states to 1284 states and 2861 transitions. [2025-04-26 16:56:14,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 401 [2025-04-26 16:56:14,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 528 [2025-04-26 16:56:14,651 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1284 states and 2861 transitions. [2025-04-26 16:56:14,651 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:14,651 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1284 states and 2861 transitions. [2025-04-26 16:56:14,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states and 2861 transitions. [2025-04-26 16:56:14,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1107. [2025-04-26 16:56:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1107 states have (on average 2.3450767841011744) internal successors, (in total 2596), 1106 states have internal predecessors, (2596), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 2596 transitions. [2025-04-26 16:56:14,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1107 states and 2596 transitions. [2025-04-26 16:56:14,689 INFO L438 stractBuchiCegarLoop]: Abstraction has 1107 states and 2596 transitions. [2025-04-26 16:56:14,689 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:56:14,689 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1107 states and 2596 transitions. [2025-04-26 16:56:14,693 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 100 [2025-04-26 16:56:14,693 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:14,693 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:14,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:14,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:14,694 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: 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]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" [2025-04-26 16:56:14,694 INFO L754 eck$LassoCheckResult]: Loop: "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" [2025-04-26 16:56:14,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:14,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1887772085, now seen corresponding path program 2 times [2025-04-26 16:56:14,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:14,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162685096] [2025-04-26 16:56:14,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:14,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:14,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-26 16:56:14,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:14,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:56:14,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,700 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:14,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:56:14,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:56:14,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:14,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:14,705 INFO L85 PathProgramCache]: Analyzing trace with hash 4064356, now seen corresponding path program 5 times [2025-04-26 16:56:14,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:14,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249715411] [2025-04-26 16:56:14,705 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:56:14,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:14,707 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:14,708 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:14,708 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:14,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:14,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:14,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:14,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:14,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:14,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:14,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1215647314, now seen corresponding path program 3 times [2025-04-26 16:56:14,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:14,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605420650] [2025-04-26 16:56:14,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:56:14,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:14,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-04-26 16:56:14,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:56:14,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-26 16:56:14,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:56:14,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:14,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605420650] [2025-04-26 16:56:14,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605420650] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:56:14,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362804835] [2025-04-26 16:56:14,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:56:14,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:56:14,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:14,792 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:56:14,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-26 16:56:14,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-04-26 16:56:14,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:56:14,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-26 16:56:14,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:14,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:56:14,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-26 16:56:14,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:56:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-26 16:56:14,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362804835] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:56:14,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:56:14,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-04-26 16:56:14,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307489780] [2025-04-26 16:56:14,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:56:14,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:14,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:56:14,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:56:14,933 INFO L87 Difference]: Start difference. First operand 1107 states and 2596 transitions. cyclomatic complexity: 1582 Second operand has 6 states, 5 states have (on average 6.0) internal successors, (in total 30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:14,988 INFO L93 Difference]: Finished difference Result 2333 states and 5146 transitions. [2025-04-26 16:56:14,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2333 states and 5146 transitions. [2025-04-26 16:56:15,003 INFO L131 ngComponentsAnalysis]: Automaton has 87 accepting balls. 280 [2025-04-26 16:56:15,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2333 states to 2278 states and 5056 transitions. [2025-04-26 16:56:15,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 880 [2025-04-26 16:56:15,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 917 [2025-04-26 16:56:15,018 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2278 states and 5056 transitions. [2025-04-26 16:56:15,018 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:15,018 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2278 states and 5056 transitions. [2025-04-26 16:56:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states and 5056 transitions. [2025-04-26 16:56:15,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 1636. [2025-04-26 16:56:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1636 states have (on average 2.363080684596577) internal successors, (in total 3866), 1635 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3866 transitions. [2025-04-26 16:56:15,048 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1636 states and 3866 transitions. [2025-04-26 16:56:15,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:56:15,049 INFO L438 stractBuchiCegarLoop]: Abstraction has 1636 states and 3866 transitions. [2025-04-26 16:56:15,049 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:56:15,049 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1636 states and 3866 transitions. [2025-04-26 16:56:15,054 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 112 [2025-04-26 16:56:15,054 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:15,054 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:15,055 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:15,055 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:15,055 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: 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]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[119] L81-->L55: 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]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" [2025-04-26 16:56:15,055 INFO L754 eck$LassoCheckResult]: Loop: "[105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[]" "[107] L56-->L56-1: Formula: (and (= (+ v_front2_11 1) v_front2_10) (< v_front2_11 v_back2_10) (= v_temp2_5 (select v_queue2_7 v_front2_11))) InVars {front2=v_front2_11, queue2=v_queue2_7, back2=v_back2_10} OutVars{front2=v_front2_10, queue2=v_queue2_7, back2=v_back2_10, temp2=v_temp2_5} AuxVars[] AssignedVars[temp2, front2]" "[108] L56-1-->L55: Formula: (= v_d2_2 (+ v_temp2_2 v_d2_3)) InVars {d2=v_d2_3, temp2=v_temp2_2} OutVars{d2=v_d2_2, temp2=v_temp2_2} AuxVars[] AssignedVars[d2]" [2025-04-26 16:56:15,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:15,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1575885015, now seen corresponding path program 2 times [2025-04-26 16:56:15,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:15,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170926047] [2025-04-26 16:56:15,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:15,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:15,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-26 16:56:15,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:15,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:56:15,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,061 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:15,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:15,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:15,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:15,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash 134121, now seen corresponding path program 3 times [2025-04-26 16:56:15,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:15,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265514447] [2025-04-26 16:56:15,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:56:15,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:15,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:15,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:15,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:56:15,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,070 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:15,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:15,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:15,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:15,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:15,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1097135041, now seen corresponding path program 2 times [2025-04-26 16:56:15,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:15,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770121413] [2025-04-26 16:56:15,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:15,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:15,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:56:15,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:56:15,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:56:15,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:15,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:56:15,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:56:15,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:15,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:15,356 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:15,356 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:15,356 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:15,356 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:15,356 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:15,356 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:15,356 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:15,356 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:15,356 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration9_Lasso [2025-04-26 16:56:15,356 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:15,356 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:15,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:15,690 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:15,690 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:15,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:15,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:15,692 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:15,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:56:15,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:15,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:15,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:15,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:15,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:15,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:15,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:15,712 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:15,719 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:15,720 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:56:15,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:15,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:15,722 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:15,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:56:15,723 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:15,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:56:15,741 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:15,741 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:15,742 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(back2, front2) = 1*back2 - 1*front2 Supporting invariants [] [2025-04-26 16:56:15,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:56:15,759 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-04-26 16:56:15,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:15,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:15,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:15,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:15,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:15,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:15,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:15,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:15,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:15,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:15,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:15,818 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:15,818 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1636 states and 3866 transitions. cyclomatic complexity: 2341 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:15,857 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1636 states and 3866 transitions. cyclomatic complexity: 2341. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2837 states and 6550 transitions. Complement of second has 5 states. [2025-04-26 16:56:15,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-26 16:56:15,862 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 23 letters. Loop has 3 letters. [2025-04-26 16:56:15,862 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:15,862 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:56:15,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:15,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:15,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:15,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:15,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:15,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:15,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:15,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:15,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:15,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:15,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:15,915 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:15,916 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1636 states and 3866 transitions. cyclomatic complexity: 2341 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:15,976 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1636 states and 3866 transitions. cyclomatic complexity: 2341. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 4277 states and 10553 transitions. Complement of second has 7 states. [2025-04-26 16:56:15,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:15,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-26 16:56:15,978 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 23 letters. Loop has 3 letters. [2025-04-26 16:56:15,978 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:15,978 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:56:15,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:15,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:15,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:15,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:15,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:15,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:16,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:16,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:16,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:16,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:16,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:16,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:16,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:16,040 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:16,040 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1636 states and 3866 transitions. cyclomatic complexity: 2341 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:16,078 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1636 states and 3866 transitions. cyclomatic complexity: 2341. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3365 states and 8539 transitions. Complement of second has 4 states. [2025-04-26 16:56:16,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-04-26 16:56:16,081 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 23 letters. Loop has 3 letters. [2025-04-26 16:56:16,081 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:16,081 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 26 letters. Loop has 3 letters. [2025-04-26 16:56:16,082 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:16,082 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 23 letters. Loop has 6 letters. [2025-04-26 16:56:16,083 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:16,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3365 states and 8539 transitions. [2025-04-26 16:56:16,099 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2025-04-26 16:56:16,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3365 states to 1125 states and 2609 transitions. [2025-04-26 16:56:16,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2025-04-26 16:56:16,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2025-04-26 16:56:16,106 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1125 states and 2609 transitions. [2025-04-26 16:56:16,106 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:16,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1125 states and 2609 transitions. [2025-04-26 16:56:16,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states and 2609 transitions. [2025-04-26 16:56:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 456. [2025-04-26 16:56:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 456 states have (on average 2.25) internal successors, (in total 1026), 455 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1026 transitions. [2025-04-26 16:56:16,115 INFO L240 hiAutomatonCegarLoop]: Abstraction has 456 states and 1026 transitions. [2025-04-26 16:56:16,115 INFO L438 stractBuchiCegarLoop]: Abstraction has 456 states and 1026 transitions. [2025-04-26 16:56:16,115 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:56:16,115 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 456 states and 1026 transitions. [2025-04-26 16:56:16,116 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2025-04-26 16:56:16,116 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:16,116 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:16,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:16,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:16,117 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: 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]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" [2025-04-26 16:56:16,117 INFO L754 eck$LassoCheckResult]: Loop: "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" [2025-04-26 16:56:16,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1869105174, now seen corresponding path program 1 times [2025-04-26 16:56:16,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:16,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134802497] [2025-04-26 16:56:16,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:16,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:16,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:56:16,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:56:16,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:16,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:56:16,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:56:16,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:16,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,129 INFO L85 PathProgramCache]: Analyzing trace with hash 4033726, now seen corresponding path program 6 times [2025-04-26 16:56:16,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:16,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967147288] [2025-04-26 16:56:16,130 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:56:16,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:16,132 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:16,135 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:16,135 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:56:16,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:16,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:16,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:16,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:16,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1930090457, now seen corresponding path program 4 times [2025-04-26 16:56:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:16,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305483466] [2025-04-26 16:56:16,141 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:56:16,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:16,143 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-26 16:56:16,145 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:56:16,145 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:56:16,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,145 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:16,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:56:16,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:56:16,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:16,292 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:16,293 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:16,293 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:16,293 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:16,293 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:16,293 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,293 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:16,293 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:16,293 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration10_Lasso [2025-04-26 16:56:16,293 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:16,293 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:16,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:16,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:16,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:16,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:16,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:16,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:16,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:16,444 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:16,445 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:16,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,446 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:56:16,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:16,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:16,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:16,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:16,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:16,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:16,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:16,462 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:16,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:56:16,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,469 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:56:16,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:16,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:16,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:16,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:16,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:16,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:16,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:16,486 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:16,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:56:16,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,495 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:56:16,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:16,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:16,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:16,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:16,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:16,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:16,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:16,512 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:16,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:16,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,521 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:56:16,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:16,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:16,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:16,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:16,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:16,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:16,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:16,538 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:16,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:16,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,546 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:56:16,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:16,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:16,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:16,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:16,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:16,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:16,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:16,562 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:16,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:56:16,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,570 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:56:16,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:56:16,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:16,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:16,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:16,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:16,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:16,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:16,587 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:16,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:16,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,595 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:56:16,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:16,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:16,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:16,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:16,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:16,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:16,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:16,613 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:16,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:16,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,621 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:56:16,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:16,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:16,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:16,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:16,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:16,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:16,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:16,637 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:16,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:16,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,646 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:56:16,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:16,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:16,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:16,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:16,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:16,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:16,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:16,668 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:16,675 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:56:16,676 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:56:16,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:16,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:16,678 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:16,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:56:16,679 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:16,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 16:56:16,696 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:16,696 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:16,696 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(back1, front1) = 1*back1 - 1*front1 Supporting invariants [] [2025-04-26 16:56:16,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:16,708 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:16,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:56:16,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:56:16,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:16,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:16,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:16,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:16,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:16,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:16,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:16,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:16,777 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:16,777 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 456 states and 1026 transitions. cyclomatic complexity: 582 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 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:56:16,799 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 456 states and 1026 transitions. cyclomatic complexity: 582. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 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 1064 states and 2388 transitions. Complement of second has 5 states. [2025-04-26 16:56:16,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 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:56:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2025-04-26 16:56:16,801 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 18 letters. Loop has 4 letters. [2025-04-26 16:56:16,802 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:16,802 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 22 letters. Loop has 4 letters. [2025-04-26 16:56:16,802 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:16,802 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:56:16,802 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:16,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1064 states and 2388 transitions. [2025-04-26 16:56:16,807 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2025-04-26 16:56:16,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1064 states to 835 states and 1888 transitions. [2025-04-26 16:56:16,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-04-26 16:56:16,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-04-26 16:56:16,812 INFO L74 IsDeterministic]: Start isDeterministic. Operand 835 states and 1888 transitions. [2025-04-26 16:56:16,812 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:16,812 INFO L218 hiAutomatonCegarLoop]: Abstraction has 835 states and 1888 transitions. [2025-04-26 16:56:16,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states and 1888 transitions. [2025-04-26 16:56:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 689. [2025-04-26 16:56:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 689 states have (on average 2.3730043541364294) internal successors, (in total 1635), 688 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1635 transitions. [2025-04-26 16:56:16,824 INFO L240 hiAutomatonCegarLoop]: Abstraction has 689 states and 1635 transitions. [2025-04-26 16:56:16,824 INFO L438 stractBuchiCegarLoop]: Abstraction has 689 states and 1635 transitions. [2025-04-26 16:56:16,824 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:56:16,824 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 689 states and 1635 transitions. [2025-04-26 16:56:16,826 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2025-04-26 16:56:16,826 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:16,826 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:16,827 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:16,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:16,827 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: 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]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" [2025-04-26 16:56:16,827 INFO L754 eck$LassoCheckResult]: Loop: "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" [2025-04-26 16:56:16,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1169489021, now seen corresponding path program 2 times [2025-04-26 16:56:16,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:16,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481080716] [2025-04-26 16:56:16,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:16,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-26 16:56:16,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:16,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:56:16,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:16,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:16,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:16,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:16,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash 4064356, now seen corresponding path program 7 times [2025-04-26 16:56:16,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:16,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594364562] [2025-04-26 16:56:16,841 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:56:16,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:16,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:16,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:16,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:16,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:16,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:16,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:16,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash -831031578, now seen corresponding path program 5 times [2025-04-26 16:56:16,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:16,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103245375] [2025-04-26 16:56:16,848 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:56:16,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:16,851 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 5 equivalence classes. [2025-04-26 16:56:16,855 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:16,855 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-26 16:56:16,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:16,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:16,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:16,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:16,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:16,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:17,023 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:17,023 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:17,023 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:17,023 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:17,023 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:17,024 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:17,024 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:17,024 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:17,024 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration11_Lasso [2025-04-26 16:56:17,024 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:17,024 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:17,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,210 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:17,210 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:17,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:17,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:17,214 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:17,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:56:17,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:17,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:17,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:17,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:17,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:17,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:17,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:17,229 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:17,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:17,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:17,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:17,236 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:17,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:56:17,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:17,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:17,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:17,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:17,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:17,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:17,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:17,253 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:17,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 16:56:17,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:17,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:17,261 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:17,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:56:17,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:17,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:17,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:17,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:17,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:17,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:17,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:17,277 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:17,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:17,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:17,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:17,284 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:17,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:56:17,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:17,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:17,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:17,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:17,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:17,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:17,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:17,299 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:17,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 16:56:17,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:17,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:17,306 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:17,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:56:17,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:17,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:17,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:17,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:17,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:17,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:17,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:17,322 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:17,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:17,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:17,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:17,329 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:17,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:56:17,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:56:17,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:17,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:17,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:17,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:17,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:17,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:17,345 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:17,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:17,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:17,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:17,353 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:17,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:56:17,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:17,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:17,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:17,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:17,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:17,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:17,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:17,374 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:17,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 16:56:17,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:17,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:17,385 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:17,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:56:17,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:17,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:17,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:17,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:17,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:17,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:17,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:17,403 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:17,408 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:56:17,408 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:56:17,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:17,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:17,410 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:17,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 16:56:17,412 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:17,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-04-26 16:56:17,427 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:17,427 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:17,427 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(back1, front1) = 1*back1 - 1*front1 Supporting invariants [] [2025-04-26 16:56:17,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 16:56:17,436 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:56:17,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:17,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:17,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:17,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:17,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:17,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:17,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:17,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:17,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:17,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:17,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:17,480 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:56:17,480 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 689 states and 1635 transitions. cyclomatic complexity: 978 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:17,505 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 689 states and 1635 transitions. cyclomatic complexity: 978. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1438 states and 3347 transitions. Complement of second has 5 states. [2025-04-26 16:56:17,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2025-04-26 16:56:17,506 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 16:56:17,506 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:17,506 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 16:56:17,506 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:17,506 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 19 letters. Loop has 8 letters. [2025-04-26 16:56:17,506 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:17,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1438 states and 3347 transitions. [2025-04-26 16:56:17,511 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2025-04-26 16:56:17,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1438 states to 1058 states and 2444 transitions. [2025-04-26 16:56:17,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-04-26 16:56:17,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-04-26 16:56:17,516 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1058 states and 2444 transitions. [2025-04-26 16:56:17,516 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:17,516 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1058 states and 2444 transitions. [2025-04-26 16:56:17,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states and 2444 transitions. [2025-04-26 16:56:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 745. [2025-04-26 16:56:17,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 745 states have (on average 2.3248322147651006) internal successors, (in total 1732), 744 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1732 transitions. [2025-04-26 16:56:17,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 745 states and 1732 transitions. [2025-04-26 16:56:17,527 INFO L438 stractBuchiCegarLoop]: Abstraction has 745 states and 1732 transitions. [2025-04-26 16:56:17,527 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 16:56:17,527 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 745 states and 1732 transitions. [2025-04-26 16:56:17,528 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2025-04-26 16:56:17,529 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:17,529 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:17,529 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:17,529 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:17,529 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: 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]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" [2025-04-26 16:56:17,529 INFO L754 eck$LassoCheckResult]: Loop: "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" [2025-04-26 16:56:17,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1028585560, now seen corresponding path program 6 times [2025-04-26 16:56:17,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95059117] [2025-04-26 16:56:17,530 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:56:17,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,532 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 4 equivalence classes. [2025-04-26 16:56:17,535 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:56:17,535 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-26 16:56:17,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,535 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:17,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:56:17,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:56:17,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:17,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,539 INFO L85 PathProgramCache]: Analyzing trace with hash 4033726, now seen corresponding path program 8 times [2025-04-26 16:56:17,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282904199] [2025-04-26 16:56:17,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:17,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:17,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:17,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:17,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:17,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:17,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:17,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:17,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:17,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1849977061, now seen corresponding path program 7 times [2025-04-26 16:56:17,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:17,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146439504] [2025-04-26 16:56:17,543 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:56:17,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:17,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:56:17,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:56:17,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,547 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:17,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:56:17,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:56:17,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:17,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:17,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:17,786 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:17,786 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:17,786 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:17,786 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:17,787 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:17,787 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:17,787 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:17,787 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:17,787 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration12_Lasso [2025-04-26 16:56:17,787 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:17,787 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:17,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:17,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:18,014 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:18,014 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:18,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,016 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:18,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 16:56:18,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:18,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,031 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 16:56:18,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,039 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:18,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 16:56:18,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:18,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,053 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-04-26 16:56:18,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,060 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:18,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 16:56:18,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:18,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,075 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:18,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,083 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:18,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 16:56:18,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:18,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,097 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-04-26 16:56:18,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,104 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:18,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 16:56:18,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:18,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,119 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-04-26 16:56:18,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,126 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:18,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 16:56:18,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:18,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,146 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:18,152 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:56:18,152 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:56:18,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,154 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:18,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 16:56:18,156 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:18,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-04-26 16:56:18,172 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:18,172 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:18,172 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(back1, front1) = 1*back1 - 1*front1 Supporting invariants [] [2025-04-26 16:56:18,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-04-26 16:56:18,181 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-04-26 16:56:18,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:56:18,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:56:18,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:18,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:18,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:18,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:18,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:18,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:18,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:18,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:18,257 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:18,257 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 745 states and 1732 transitions. cyclomatic complexity: 1024 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:56:18,278 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 745 states and 1732 transitions. cyclomatic complexity: 1024. 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 1372 states and 3097 transitions. Complement of second has 5 states. [2025-04-26 16:56:18,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:18,278 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:56:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2025-04-26 16:56:18,278 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 25 letters. Loop has 4 letters. [2025-04-26 16:56:18,278 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:18,278 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:56:18,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:56:18,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:56:18,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:18,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:18,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:18,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:18,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:18,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:18,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:18,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:18,349 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:18,349 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 745 states and 1732 transitions. cyclomatic complexity: 1024 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:56:18,381 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 745 states and 1732 transitions. cyclomatic complexity: 1024. 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 2117 states and 5063 transitions. Complement of second has 7 states. [2025-04-26 16:56:18,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:18,382 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:56:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-26 16:56:18,382 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 25 letters. Loop has 4 letters. [2025-04-26 16:56:18,383 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:18,383 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:56:18,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:56:18,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:56:18,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:18,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:18,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:18,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:18,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:18,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:18,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:18,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:18,451 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:18,451 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 745 states and 1732 transitions. cyclomatic complexity: 1024 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:56:18,479 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 745 states and 1732 transitions. cyclomatic complexity: 1024. 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 1868 states and 4613 transitions. Complement of second has 6 states. [2025-04-26 16:56:18,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:18,479 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:56:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-26 16:56:18,480 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 25 letters. Loop has 4 letters. [2025-04-26 16:56:18,480 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:18,480 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 29 letters. Loop has 4 letters. [2025-04-26 16:56:18,480 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:18,480 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 25 letters. Loop has 8 letters. [2025-04-26 16:56:18,480 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:18,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1868 states and 4613 transitions. [2025-04-26 16:56:18,487 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:18,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1868 states to 0 states and 0 transitions. [2025-04-26 16:56:18,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:18,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:18,488 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:18,488 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:18,488 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:18,488 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:18,488 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:18,488 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 16:56:18,488 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:18,488 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:18,488 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:18,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:56:18,501 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:18 BoogieIcfgContainer [2025-04-26 16:56:18,501 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:18,502 INFO L158 Benchmark]: Toolchain (without parser) took 9106.84ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 93.1MB in the beginning and 142.5MB in the end (delta: -49.4MB). Peak memory consumption was 83.7MB. Max. memory is 8.0GB. [2025-04-26 16:56:18,503 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 167.8MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:18,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.61ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 91.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:18,504 INFO L158 Benchmark]: Boogie Preprocessor took 22.42ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 90.2MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:18,504 INFO L158 Benchmark]: RCFGBuilder took 242.60ms. Allocated memory is still 167.8MB. Free memory was 90.2MB in the beginning and 79.3MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:18,504 INFO L158 Benchmark]: BuchiAutomizer took 8804.87ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 79.3MB in the beginning and 142.5MB in the end (delta: -63.2MB). Peak memory consumption was 71.1MB. Max. memory is 8.0GB. [2025-04-26 16:56:18,505 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.26ms. Allocated memory is still 167.8MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.61ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 91.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.42ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 90.2MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 242.60ms. Allocated memory is still 167.8MB. Free memory was 90.2MB in the beginning and 79.3MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 8804.87ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 79.3MB in the beginning and 142.5MB in the end (delta: -63.2MB). Peak memory consumption was 71.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.6s and 13 iterations. TraceHistogramMax:4. Analysis of lassos took 5.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 3863 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 565 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 554 mSDsluCounter, 627 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 275 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 408 IncrementalHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 352 mSDtfsCounter, 408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU1 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax100 hnf100 lsp66 ukn93 mio100 lsp58 div100 bol100 ite100 ukn100 eq212 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 419, Number of transitions in reduction automaton: 1098, Number of states in reduction automaton: 612, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (5 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function w and consists of 5 locations. One deterministic module has affine ranking function back2 + -1 * front2 and consists of 3 locations. One deterministic module has affine ranking function -1 * front1 + back1 and consists of 3 locations. One deterministic module has affine ranking function -1 * front1 + back1 and consists of 3 locations. One deterministic module has affine ranking function -1 * front1 + back1 and consists of 3 locations. One nondeterministic module has affine ranking function back2 + -1 * front2 and consists of 3 locations. One nondeterministic module has affine ranking function -1 * front1 + back1 and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:18,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-26 16:56:18,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:18,924 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...