/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-bad/counter-queue.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:48,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:48,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:48,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:48,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:48,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:40:48,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:48,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:48,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:48,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:48,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:48,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:48,970 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:48,970 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:48,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:48,971 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:48,972 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:48,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:48,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:48,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:48,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:48,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:48,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:48,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:48,972 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:48,972 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:48,972 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:49,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:49,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:49,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:49,206 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:49,207 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:49,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/counter-queue.wvr.bpl [2025-04-26 18:40:49,209 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/counter-queue.wvr.bpl' [2025-04-26 18:40:49,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:49,236 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:49,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:49,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:49,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:49,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:49" (1/1) ... [2025-04-26 18:40:49,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:49" (1/1) ... [2025-04-26 18:40:49,273 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:49,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:49,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:49,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:49,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:49,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:49" (1/1) ... [2025-04-26 18:40:49,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:49" (1/1) ... [2025-04-26 18:40:49,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:49" (1/1) ... [2025-04-26 18:40:49,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:49" (1/1) ... [2025-04-26 18:40:49,284 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:49" (1/1) ... [2025-04-26 18:40:49,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:49" (1/1) ... [2025-04-26 18:40:49,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:49" (1/1) ... [2025-04-26 18:40:49,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:49" (1/1) ... [2025-04-26 18:40:49,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:49" (1/1) ... [2025-04-26 18:40:49,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:49,302 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:49,302 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:49,302 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:49,303 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:49" (1/1) ... [2025-04-26 18:40:49,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:49,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:49,332 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 18:40:49,334 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 18:40:49,357 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:49,357 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:49,357 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:49,357 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:49,357 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:49,357 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:49,357 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:49,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:49,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:49,358 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 18:40:49,395 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:49,397 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:49,478 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:49,478 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:49,498 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:49,499 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:40:49,500 INFO L201 PluginConnector]: Adding new model counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:49 BoogieIcfgContainer [2025-04-26 18:40:49,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:49,501 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:49,501 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:49,506 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:49,506 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:49,506 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:49" (1/2) ... [2025-04-26 18:40:49,507 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@459bc880 and model type counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:49, skipping insertion in model container [2025-04-26 18:40:49,507 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:49,508 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:49" (2/2) ... [2025-04-26 18:40:49,508 INFO L376 chiAutomizerObserver]: Analyzing ICFG counter-queue.wvr.bpl [2025-04-26 18:40:49,548 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:40:49,577 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:49,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:49,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:49,579 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 18:40:49,582 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 18:40:49,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 62 flow [2025-04-26 18:40:49,661 INFO L116 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-04-26 18:40:49,663 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:40:49,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-26 18:40:49,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 24 transitions, 62 flow [2025-04-26 18:40:49,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 20 transitions, 52 flow [2025-04-26 18:40:49,672 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 25 places, 20 transitions, 52 flow [2025-04-26 18:40:49,673 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 20 transitions, 52 flow [2025-04-26 18:40:49,684 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 34 states, 32 states have (on average 1.8125) internal successors, (in total 58), 33 states have internal predecessors, (58), 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 18:40:49,684 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 34 states, 32 states have (on average 1.8125) internal successors, (in total 58), 33 states have internal predecessors, (58), 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 18:40:49,686 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:49,739 WARN L140 AmpleReduction]: Number of pruned transitions: 10 [2025-04-26 18:40:49,739 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:40:49,739 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 6 [2025-04-26 18:40:49,740 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:18 [2025-04-26 18:40:49,740 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:9 [2025-04-26 18:40:49,740 WARN L145 AmpleReduction]: Times succ was already a loop node:10 [2025-04-26 18:40:49,740 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:40:49,740 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:49,740 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 34 states, 32 states have (on average 1.5) internal successors, (in total 48), 33 states have internal predecessors, (48), 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 18:40:49,746 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:49,746 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:49,747 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:49,747 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:49,747 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:49,747 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:49,747 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:49,747 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:49,750 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 32 states have (on average 1.5) internal successors, (in total 48), 33 states have internal predecessors, (48), 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 18:40:49,762 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 18:40:49,763 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:49,763 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:49,765 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:49,766 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:49,766 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:49,766 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 32 states have (on average 1.5) internal successors, (in total 48), 33 states have internal predecessors, (48), 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 18:40:49,767 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 18:40:49,768 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:49,768 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:49,768 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:49,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:49,773 INFO L752 eck$LassoCheckResult]: Stem: "[42] $Ultimate##0-->L42: Formula: (= v_i1_6 0) InVars {i1=v_i1_6} OutVars{i1=v_i1_6} AuxVars[] AssignedVars[]" "[39] L42-->L43: Formula: (= v_counter_5 0) InVars {counter=v_counter_5} OutVars{counter=v_counter_5} AuxVars[] AssignedVars[]" "[35] L43-->L44: Formula: (= v_i2_6 0) InVars {i2=v_i2_6} OutVars{i2=v_i2_6} AuxVars[] AssignedVars[]" "[33] L44-->L45: Formula: (= v_N2_3 v_N1_3) InVars {N2=v_N2_3, N1=v_N1_3} OutVars{N2=v_N2_3, N1=v_N1_3} AuxVars[] AssignedVars[]" "[60] L45-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:40:49,773 INFO L754 eck$LassoCheckResult]: Loop: "[51] L20-1-->L20: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[53] L20-->L20-1: Formula: (and (= v_i1_7 (+ v_i1_8 1)) (= v_counter_7 (+ v_counter_8 (select v_A_3 v_i1_8)))) InVars {A=v_A_3, i1=v_i1_8, counter=v_counter_8} OutVars{A=v_A_3, i1=v_i1_7, counter=v_counter_7} AuxVars[] AssignedVars[counter, i1]" [2025-04-26 18:40:49,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:49,777 INFO L85 PathProgramCache]: Analyzing trace with hash 68613600, now seen corresponding path program 1 times [2025-04-26 18:40:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:49,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916626629] [2025-04-26 18:40:49,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:49,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:49,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:49,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:49,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:49,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:49,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:49,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:49,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:49,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:49,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:49,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2595, now seen corresponding path program 1 times [2025-04-26 18:40:49,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:49,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044045170] [2025-04-26 18:40:49,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:49,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:49,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:49,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:49,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:49,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:49,860 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:49,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:49,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:49,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:49,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:49,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:49,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:49,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1513161794, now seen corresponding path program 1 times [2025-04-26 18:40:49,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:49,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730835116] [2025-04-26 18:40:49,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:49,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:49,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:49,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:49,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:49,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:49,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:49,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:49,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:49,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:49,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:49,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:49,978 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:49,978 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:49,978 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:49,978 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:49,979 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:49,979 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:49,979 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:49,979 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:49,979 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-queue.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:49,979 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:49,979 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:49,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,121 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:50,141 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:50,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,145 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 18:40:50,146 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 18:40:50,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:50,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:50,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:50,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:50,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:50,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:50,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:50,177 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:50,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:40:50,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,185 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 18:40:50,187 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 18:40:50,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:50,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:50,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:50,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:50,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:50,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:50,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:50,210 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:50,222 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:40:50,223 INFO L437 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:40:50,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,226 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 18:40:50,228 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 18:40:50,229 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:50,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:50,246 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:50,246 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:50,247 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N1) = -1*i1 + 1*N1 Supporting invariants [] [2025-04-26 18:40:50,252 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 18:40:50,255 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:50,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:50,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:50,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:50,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:50,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:50,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:50,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:50,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:50,308 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:50,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:50,346 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 18:40:50,360 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 18:40:50,362 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 34 states, 32 states have (on average 1.5) internal successors, (in total 48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:50,421 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 34 states, 32 states have (on average 1.5) internal successors, (in total 48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 68 states and 103 transitions. Complement of second has 7 states. [2025-04-26 18:40:50,423 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 18:40:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2025-04-26 18:40:50,436 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:40:50,437 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:50,437 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:40:50,437 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:50,437 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:40:50,437 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:50,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 103 transitions. [2025-04-26 18:40:50,439 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:40:50,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 24 states and 35 transitions. [2025-04-26 18:40:50,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-04-26 18:40:50,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-04-26 18:40:50,446 INFO L74 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2025-04-26 18:40:50,446 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:50,446 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-04-26 18:40:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2025-04-26 18:40:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-04-26 18:40:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (in total 32), 21 states have internal predecessors, (32), 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 18:40:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2025-04-26 18:40:50,466 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 32 transitions. [2025-04-26 18:40:50,466 INFO L438 stractBuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2025-04-26 18:40:50,466 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:50,466 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2025-04-26 18:40:50,467 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:40:50,467 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:50,467 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:50,468 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:50,468 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:50,468 INFO L752 eck$LassoCheckResult]: Stem: "[42] $Ultimate##0-->L42: Formula: (= v_i1_6 0) InVars {i1=v_i1_6} OutVars{i1=v_i1_6} AuxVars[] AssignedVars[]" "[39] L42-->L43: Formula: (= v_counter_5 0) InVars {counter=v_counter_5} OutVars{counter=v_counter_5} AuxVars[] AssignedVars[]" "[35] L43-->L44: Formula: (= v_i2_6 0) InVars {i2=v_i2_6} OutVars{i2=v_i2_6} AuxVars[] AssignedVars[]" "[33] L44-->L45: Formula: (= v_N2_3 v_N1_3) InVars {N2=v_N2_3, N1=v_N1_3} OutVars{N2=v_N2_3, N1=v_N1_3} AuxVars[] AssignedVars[]" "[60] L45-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[50] L20-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_5) InVars {i1=v_i1_5, N1=v_N1_2} OutVars{i1=v_i1_5, N1=v_N1_2} AuxVars[] AssignedVars[]" "[52] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[63] L45-1-->L31-1: 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 18:40:50,468 INFO L754 eck$LassoCheckResult]: Loop: "[55] L31-1-->L31: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[57] L31-->L31-1: Formula: (and (= v_i2_7 (+ v_i2_8 1)) (= v_counter_12 (+ (select v_A_5 v_i2_8) v_counter_11))) InVars {A=v_A_5, i2=v_i2_8, counter=v_counter_12} OutVars{A=v_A_5, i2=v_i2_7, counter=v_counter_11} AuxVars[] AssignedVars[counter, i2]" [2025-04-26 18:40:50,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,469 INFO L85 PathProgramCache]: Analyzing trace with hash -336625571, now seen corresponding path program 1 times [2025-04-26 18:40:50,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870437596] [2025-04-26 18:40:50,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:50,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:50,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,474 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:50,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:50,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 1 times [2025-04-26 18:40:50,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022804965] [2025-04-26 18:40:50,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:50,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:50,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,486 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:50,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:50,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1374624769, now seen corresponding path program 1 times [2025-04-26 18:40:50,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539978673] [2025-04-26 18:40:50,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:50,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:50,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:50,582 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 18:40:50,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:50,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539978673] [2025-04-26 18:40:50,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539978673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:50,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:50,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:40:50,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226178326] [2025-04-26 18:40:50,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:50,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:40:50,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:40:50,613 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (in total 10), 5 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 18:40:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:50,677 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2025-04-26 18:40:50,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. [2025-04-26 18:40:50,678 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:40:50,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 34 transitions. [2025-04-26 18:40:50,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-04-26 18:40:50,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-04-26 18:40:50,679 INFO L74 IsDeterministic]: Start isDeterministic. Operand 24 states and 34 transitions. [2025-04-26 18:40:50,679 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:50,679 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-04-26 18:40:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 34 transitions. [2025-04-26 18:40:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-04-26 18:40:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (in total 31), 21 states have internal predecessors, (31), 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 18:40:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2025-04-26 18:40:50,683 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-04-26 18:40:50,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 18:40:50,684 INFO L438 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-04-26 18:40:50,684 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:50,684 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2025-04-26 18:40:50,685 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:40:50,685 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:50,685 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:50,685 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:50,685 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:50,685 INFO L752 eck$LassoCheckResult]: Stem: "[42] $Ultimate##0-->L42: Formula: (= v_i1_6 0) InVars {i1=v_i1_6} OutVars{i1=v_i1_6} AuxVars[] AssignedVars[]" "[39] L42-->L43: Formula: (= v_counter_5 0) InVars {counter=v_counter_5} OutVars{counter=v_counter_5} AuxVars[] AssignedVars[]" "[35] L43-->L44: Formula: (= v_i2_6 0) InVars {i2=v_i2_6} OutVars{i2=v_i2_6} AuxVars[] AssignedVars[]" "[33] L44-->L45: Formula: (= v_N2_3 v_N1_3) InVars {N2=v_N2_3, N1=v_N1_3} OutVars{N2=v_N2_3, N1=v_N1_3} AuxVars[] AssignedVars[]" "[60] L45-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[51] L20-1-->L20: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[63] L45-1-->L31-1: 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]" "[53] L20-->L20-1: Formula: (and (= v_i1_7 (+ v_i1_8 1)) (= v_counter_7 (+ v_counter_8 (select v_A_3 v_i1_8)))) InVars {A=v_A_3, i1=v_i1_8, counter=v_counter_8} OutVars{A=v_A_3, i1=v_i1_7, counter=v_counter_7} AuxVars[] AssignedVars[counter, i1]" "[50] L20-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_5) InVars {i1=v_i1_5, N1=v_N1_2} OutVars{i1=v_i1_5, N1=v_N1_2} AuxVars[] AssignedVars[]" [2025-04-26 18:40:50,685 INFO L754 eck$LassoCheckResult]: Loop: "[55] L31-1-->L31: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[57] L31-->L31-1: Formula: (and (= v_i2_7 (+ v_i2_8 1)) (= v_counter_12 (+ (select v_A_5 v_i2_8) v_counter_11))) InVars {A=v_A_5, i2=v_i2_8, counter=v_counter_12} OutVars{A=v_A_5, i2=v_i2_7, counter=v_counter_11} AuxVars[] AssignedVars[counter, i2]" [2025-04-26 18:40:50,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1845418007, now seen corresponding path program 1 times [2025-04-26 18:40:50,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533966781] [2025-04-26 18:40:50,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:50,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:50,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:50,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:50,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 2 times [2025-04-26 18:40:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024791656] [2025-04-26 18:40:50,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:50,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:50,704 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:50,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,704 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:50,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:50,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash 374790283, now seen corresponding path program 1 times [2025-04-26 18:40:50,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113923608] [2025-04-26 18:40:50,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:50,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:50,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,717 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:50,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:50,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,806 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:50,806 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:50,806 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:50,806 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:50,806 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:50,806 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,806 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:50,806 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:50,806 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-queue.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:40:50,806 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:50,806 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:50,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,922 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:50,922 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:50,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,924 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 18:40:50,926 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 18:40:50,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:50,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:50,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:50,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:50,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:50,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:50,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:50,944 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:50,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:40:50,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,953 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 18:40:50,954 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 18:40:50,955 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 18:40:50,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:50,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:50,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:50,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:50,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:50,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:50,971 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:50,977 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 18:40:50,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,979 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 18:40:50,980 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 18:40:50,982 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 18:40:50,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:50,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:50,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:50,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:50,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:50,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:50,996 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:51,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:51,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,004 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 18:40:51,006 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 18:40:51,007 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 18:40:51,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:51,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:51,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:51,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:51,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:51,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:51,024 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:51,033 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:40:51,033 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:40:51,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,035 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:51,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:40:51,038 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:51,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:40:51,055 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:51,055 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:51,055 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, i2) = 1*N2 - 1*i2 Supporting invariants [] [2025-04-26 18:40:51,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:40:51,062 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:51,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:51,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:51,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:51,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:51,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:51,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:51,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:51,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:51,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:51,098 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:51,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:51,108 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 18:40:51,108 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 18:40:51,108 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 18:40:51,130 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 41 states and 58 transitions. Complement of second has 6 states. [2025-04-26 18:40:51,130 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 18:40:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 18:40:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-04-26 18:40:51,131 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:40:51,132 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:51,132 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:40:51,132 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:51,132 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:40:51,132 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:51,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2025-04-26 18:40:51,133 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:51,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2025-04-26 18:40:51,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:51,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:51,133 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:51,133 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:51,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:51,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:51,133 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:51,133 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:51,133 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:51,133 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:51,133 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:51,146 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 18:40:51,148 INFO L201 PluginConnector]: Adding new model counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:51 BoogieIcfgContainer [2025-04-26 18:40:51,148 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:51,148 INFO L158 Benchmark]: Toolchain (without parser) took 1912.83ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.8MB in the beginning and 44.2MB in the end (delta: 42.7MB). Peak memory consumption was 25.1MB. Max. memory is 8.0GB. [2025-04-26 18:40:51,149 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.80ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:51,149 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.72ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:51,149 INFO L158 Benchmark]: Boogie Preprocessor took 26.10ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:51,149 INFO L158 Benchmark]: RCFGBuilder took 197.90ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 74.7MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:40:51,149 INFO L158 Benchmark]: BuchiAutomizer took 1646.82ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.6MB in the beginning and 44.2MB in the end (delta: 30.5MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2025-04-26 18:40:51,150 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.80ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.72ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.10ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 197.90ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 74.7MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1646.82ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.6MB in the beginning and 44.2MB in the end (delta: 30.5MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 26 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital42 mio100 ax100 hnf100 lsp73 ukn94 mio100 lsp62 div100 bol100 ite100 ukn100 eq180 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 166, Number of transitions in reduction automaton: 48, Number of states in reduction automaton: 34, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N1 + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. 1 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 18:40:51,163 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...