/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/chl/name-comparator-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:49,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:49,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:49,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:49,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:49,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:49,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:49,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:49,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:49,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:49,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:49,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:49,310 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:49,310 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:49,310 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:49,310 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:49,310 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:49,310 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:49,310 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:49,310 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:49,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:49,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:49,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:49,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:49,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:49,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:49,312 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:49,312 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:49,312 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:49,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:49,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:49,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:49,609 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:49,610 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:49,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-symm.wvr.bpl [2025-04-26 16:54:49,612 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-symm.wvr.bpl' [2025-04-26 16:54:49,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:49,640 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:49,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:49,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:49,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:49,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:49" (1/1) ... [2025-04-26 16:54:49,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:49" (1/1) ... [2025-04-26 16:54:49,677 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:49,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:49,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:49,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:49,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:49,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:49" (1/1) ... [2025-04-26 16:54:49,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:49" (1/1) ... [2025-04-26 16:54:49,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:49" (1/1) ... [2025-04-26 16:54:49,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:49" (1/1) ... [2025-04-26 16:54:49,689 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:49" (1/1) ... [2025-04-26 16:54:49,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:49" (1/1) ... [2025-04-26 16:54:49,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:49" (1/1) ... [2025-04-26 16:54:49,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:49" (1/1) ... [2025-04-26 16:54:49,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:49" (1/1) ... [2025-04-26 16:54:49,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:49,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:49,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:49,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:49,713 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:49" (1/1) ... [2025-04-26 16:54:49,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:49,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:49,738 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:54:49,741 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:54:49,764 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:49,765 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:49,765 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:49,765 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:49,765 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:49,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:49,766 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:54:49,806 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:49,807 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:49,914 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:49,914 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:49,959 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:49,960 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 16:54:49,960 INFO L201 PluginConnector]: Adding new model name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:49 BoogieIcfgContainer [2025-04-26 16:54:49,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:49,961 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:49,961 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:49,965 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:49,965 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:49,965 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:49" (1/2) ... [2025-04-26 16:54:49,966 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d769f2f and model type name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:49, skipping insertion in model container [2025-04-26 16:54:49,966 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:49,966 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:49" (2/2) ... [2025-04-26 16:54:49,967 INFO L376 chiAutomizerObserver]: Analyzing ICFG name-comparator-symm.wvr.bpl [2025-04-26 16:54:50,019 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:54:50,057 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:50,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:50,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:50,061 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:54:50,062 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:54:50,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 16:54:50,139 INFO L116 PetriNetUnfolderBase]: 2/16 cut-off events. [2025-04-26 16:54:50,141 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:54:50,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 2/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-26 16:54:50,146 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 16:54:50,150 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 44 flow [2025-04-26 16:54:50,150 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 21 places, 16 transitions, 44 flow [2025-04-26 16:54:50,156 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:50,195 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 44#[L57, thread1EXIT, L77]true [2025-04-26 16:54:50,197 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 30#[L31, L76]true [2025-04-26 16:54:50,199 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 70#[thread1FINAL, L57, L77]true [2025-04-26 16:54:50,199 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 68#[L31, L57, L77]true [2025-04-26 16:54:50,200 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 72#[L31, thread2FINAL, L77]true [2025-04-26 16:54:50,200 WARN L140 AmpleReduction]: Number of pruned transitions: 8 [2025-04-26 16:54:50,200 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 5 [2025-04-26 16:54:50,200 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 5 [2025-04-26 16:54:50,201 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:12 [2025-04-26 16:54:50,201 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:11 [2025-04-26 16:54:50,201 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:54:50,201 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:54:50,201 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:50,202 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (in total 35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:50,207 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:50,207 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:50,207 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:50,208 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:50,208 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:50,208 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:50,208 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:50,208 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:50,209 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (in total 35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:50,217 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2025-04-26 16:54:50,217 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:50,217 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:50,220 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:50,220 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:50,220 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:50,220 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (in total 35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:50,221 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2025-04-26 16:54:50,221 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:50,221 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:50,221 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:50,221 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:50,225 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] $Ultimate##0-->L31: Formula: (let ((.cse0 (= v_name_1_15 v_name_2_15)) (.cse1 (not v_break_6_58))) (and (= v_result_3_18 (ite .cse0 0 v_result_3_19)) (= v_i_4_9 0) .cse1 (or (and (or .cse0 v_break_6_58) v_break_6_22) (and (not v_break_6_22) (not .cse0) .cse1)))) InVars {name_2=v_name_2_15, name_1=v_name_1_15, result_3=v_result_3_19} OutVars{name_2=v_name_2_15, i_4=v_i_4_9, result_3=v_result_3_18, name_1=v_name_1_15, break_6=v_break_6_22} AuxVars[v_break_6_58] AssignedVars[i_4, break_6, result_3]" [2025-04-26 16:54:50,225 INFO L754 eck$LassoCheckResult]: Loop: "[82] L31-->L31: Formula: (let ((.cse4 (= v_name_2_27 v_current_5_16)) (.cse3 (not v_break_6_60))) (let ((.cse0 (not v_break_6_49)) (.cse2 (= v_name_1_23 v_current_5_16)) (.cse1 (and .cse4 .cse3))) (and .cse0 (= v_result_3_40 (ite .cse1 (- 1) (ite .cse2 1 v_result_3_41))) (< v_i_4_30 3) (or (and v_break_6_60 (or v_break_6_49 .cse2)) (and .cse0 (not .cse2) .cse3)) (or (and (or (not .cse4) v_break_6_60) (not v_break_6_48) .cse3) (and v_break_6_48 (or .cse1 v_break_6_60))) (= (select v_nondet_0_5 v_i_4_30) v_current_5_16) (= (+ v_i_4_30 1) v_i_4_29)))) InVars {name_2=v_name_2_27, i_4=v_i_4_30, result_3=v_result_3_41, nondet_0=v_nondet_0_5, name_1=v_name_1_23, break_6=v_break_6_49} OutVars{name_2=v_name_2_27, i_4=v_i_4_29, current_5=v_current_5_16, name_1=v_name_1_23, break_6=v_break_6_48, result_3=v_result_3_40, nondet_0=v_nondet_0_5} AuxVars[v_break_6_60] AssignedVars[i_4, current_5, break_6, result_3]" [2025-04-26 16:54:50,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:50,229 INFO L85 PathProgramCache]: Analyzing trace with hash 3831, now seen corresponding path program 1 times [2025-04-26 16:54:50,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:50,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3808046] [2025-04-26 16:54:50,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:50,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:50,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:50,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:50,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:50,290 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:50,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:50,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:50,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:50,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:50,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:50,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash 113, now seen corresponding path program 1 times [2025-04-26 16:54:50,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:50,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90907143] [2025-04-26 16:54:50,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:50,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:50,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:50,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:50,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:50,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:50,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:50,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:50,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:50,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:50,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:50,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:50,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash 118843, now seen corresponding path program 1 times [2025-04-26 16:54:50,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:50,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005682455] [2025-04-26 16:54:50,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:50,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:50,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:50,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:50,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:50,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:50,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:50,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:50,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:50,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:50,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:50,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:50,908 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:50,909 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:50,909 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:50,909 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:50,909 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:50,909 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:50,909 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:50,909 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:50,909 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-symm.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:50,909 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:50,909 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:50,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:51,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:51,122 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:54:51,442 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:51,445 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:51,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:51,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:51,448 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:54:51,450 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:54:51,451 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:54:51,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:51,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:51,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:51,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:51,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:51,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:51,477 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:51,490 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:54:51,490 INFO L437 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:54:51,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:51,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:51,494 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:54:51,496 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:54:51,496 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:51,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:54:51,513 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:51,514 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:51,514 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_4) = -2*i_4 + 5 Supporting invariants [] [2025-04-26 16:54:51,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:54:51,521 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:51,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:51,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:51,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:51,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:51,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:51,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:51,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:51,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:51,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:51,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:51,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:51,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:51,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:51,566 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:54:51,584 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:54:51,585 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (in total 35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:54:51,634 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (in total 35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 53 states and 92 transitions. Complement of second has 5 states. [2025-04-26 16:54:51,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:54:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-04-26 16:54:51,646 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:54:51,647 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:51,647 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:54:51,647 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:51,647 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:54:51,648 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:51,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 92 transitions. [2025-04-26 16:54:51,653 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 16:54:51,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 17 states and 30 transitions. [2025-04-26 16:54:51,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-04-26 16:54:51,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-04-26 16:54:51,659 INFO L74 IsDeterministic]: Start isDeterministic. Operand 17 states and 30 transitions. [2025-04-26 16:54:51,659 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:51,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 30 transitions. [2025-04-26 16:54:51,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 30 transitions. [2025-04-26 16:54:51,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2025-04-26 16:54:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8) internal successors, (in total 27), 14 states have internal predecessors, (27), 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:54:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2025-04-26 16:54:51,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 27 transitions. [2025-04-26 16:54:51,676 INFO L438 stractBuchiCegarLoop]: Abstraction has 15 states and 27 transitions. [2025-04-26 16:54:51,676 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:51,676 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 27 transitions. [2025-04-26 16:54:51,676 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 16:54:51,678 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:51,678 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:51,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:54:51,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:51,679 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] $Ultimate##0-->L31: Formula: (let ((.cse0 (= v_name_1_15 v_name_2_15)) (.cse1 (not v_break_6_58))) (and (= v_result_3_18 (ite .cse0 0 v_result_3_19)) (= v_i_4_9 0) .cse1 (or (and (or .cse0 v_break_6_58) v_break_6_22) (and (not v_break_6_22) (not .cse0) .cse1)))) InVars {name_2=v_name_2_15, name_1=v_name_1_15, result_3=v_result_3_19} OutVars{name_2=v_name_2_15, i_4=v_i_4_9, result_3=v_result_3_18, name_1=v_name_1_15, break_6=v_break_6_22} AuxVars[v_break_6_58] AssignedVars[i_4, break_6, result_3]" "[93] L76-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[84] $Ultimate##0-->L57: Formula: (let ((.cse1 (not v_break_10_62)) (.cse0 (= v_name_1_41 v_name_2_41))) (and (or (and (or .cse0 v_break_10_62) v_break_10_52) (and (not v_break_10_52) (not .cse0) .cse1)) (= v_i_8_31 0) .cse1 (= v_result_7_40 (ite .cse0 0 v_result_7_41)))) InVars {name_2=v_name_2_41, name_1=v_name_1_41, result_7=v_result_7_41} OutVars{break_10=v_break_10_52, name_2=v_name_2_41, name_1=v_name_1_41, i_8=v_i_8_31, result_7=v_result_7_40} AuxVars[v_break_10_62] AssignedVars[break_10, result_7, i_8]" [2025-04-26 16:54:51,679 INFO L754 eck$LassoCheckResult]: Loop: "[85] L57-->L57: Formula: (let ((.cse3 (= v_name_1_35 v_current_9_16)) (.cse2 (not v_break_10_64))) (let ((.cse1 (and .cse3 .cse2)) (.cse0 (not v_break_10_39)) (.cse4 (= v_name_2_35 v_current_9_16))) (and .cse0 (or (and v_break_10_38 (or .cse1 v_break_10_64)) (and (not v_break_10_38) .cse2 (or v_break_10_64 (not .cse3)))) (< v_i_8_28 3) (= v_result_7_28 (ite .cse1 (- 1) (ite .cse4 1 v_result_7_29))) (= v_i_8_27 (+ v_i_8_28 1)) (or (and (or v_break_10_39 .cse4) v_break_10_64) (and .cse0 .cse2 (not .cse4))) (= (select v_nondet_0_9 v_i_8_28) v_current_9_16)))) InVars {break_10=v_break_10_39, name_2=v_name_2_35, nondet_0=v_nondet_0_9, name_1=v_name_1_35, i_8=v_i_8_28, result_7=v_result_7_29} OutVars{break_10=v_break_10_38, name_2=v_name_2_35, name_1=v_name_1_35, result_7=v_result_7_28, current_9=v_current_9_16, nondet_0=v_nondet_0_9, i_8=v_i_8_27} AuxVars[v_break_10_64] AssignedVars[break_10, result_7, current_9, i_8]" [2025-04-26 16:54:51,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:51,680 INFO L85 PathProgramCache]: Analyzing trace with hash 3684558, now seen corresponding path program 1 times [2025-04-26 16:54:51,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:51,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952159315] [2025-04-26 16:54:51,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:51,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:51,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:51,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:51,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:51,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:51,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:51,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:51,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:51,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:51,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:51,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:51,703 INFO L85 PathProgramCache]: Analyzing trace with hash 116, now seen corresponding path program 1 times [2025-04-26 16:54:51,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:51,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018747293] [2025-04-26 16:54:51,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:51,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:51,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:51,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:51,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:51,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:51,709 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:51,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:51,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:51,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:51,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:51,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:51,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash 114221383, now seen corresponding path program 1 times [2025-04-26 16:54:51,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:51,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104477226] [2025-04-26 16:54:51,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:51,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:51,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:51,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:51,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:51,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:51,739 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:51,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:51,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:51,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:51,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:51,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:52,108 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:52,109 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:52,109 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:52,109 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:52,109 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:52,109 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:52,109 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:52,109 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:52,109 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-symm.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:54:52,109 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:52,109 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:52,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:52,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:52,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:52,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:52,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:52,367 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 16:54:52,368 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:54:52,660 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:52,660 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:52,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:52,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:52,662 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:54:52,664 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:54:52,665 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:54:52,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:52,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:52,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:52,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:52,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:52,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:52,681 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:52,686 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:54:52,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:52,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:52,688 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:54:52,690 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:54:52,691 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:54:52,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:52,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:52,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:52,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:52,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:52,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:52,708 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:52,715 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:54:52,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:52,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:52,717 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:54:52,718 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:54:52,720 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:54:52,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:52,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:52,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:52,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:52,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:52,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:52,735 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:52,741 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:54:52,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:52,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:52,743 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:54:52,744 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:54:52,746 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:54:52,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:52,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:52,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:52,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:52,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:52,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:52,764 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:52,769 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:54:52,769 INFO L437 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 16:54:52,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:52,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:52,772 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:54:52,773 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:54:52,774 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:52,789 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:54:52,792 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:52,793 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:52,793 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_8) = -2*i_8 + 5 Supporting invariants [] [2025-04-26 16:54:52,798 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:54:52,799 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:52,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:52,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:52,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:52,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:52,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:52,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:52,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:52,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:52,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:52,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:52,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:52,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:52,835 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:54:52,835 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:54:52,836 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 27 transitions. cyclomatic complexity: 18 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 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:54:52,860 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 27 transitions. cyclomatic complexity: 18. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 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 24 states and 41 transitions. Complement of second has 4 states. [2025-04-26 16:54:52,861 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:54:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 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:54:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-04-26 16:54:52,862 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:54:52,862 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:52,863 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 16:54:52,863 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:52,863 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:54:52,863 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:52,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 41 transitions. [2025-04-26 16:54:52,863 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:52,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2025-04-26 16:54:52,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:52,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:52,864 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:52,864 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:52,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:52,864 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:52,864 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:52,864 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:52,864 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:52,864 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:52,864 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:52,879 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:54:52,880 INFO L201 PluginConnector]: Adding new model name-comparator-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:52 BoogieIcfgContainer [2025-04-26 16:54:52,881 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:52,881 INFO L158 Benchmark]: Toolchain (without parser) took 3241.32ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 83.7MB in the beginning and 48.1MB in the end (delta: 35.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:54:52,881 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 155.2MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:52,882 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.47ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 81.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:52,882 INFO L158 Benchmark]: Boogie Preprocessor took 28.96ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 80.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:52,882 INFO L158 Benchmark]: RCFGBuilder took 250.98ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 65.8MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-26 16:54:52,882 INFO L158 Benchmark]: BuchiAutomizer took 2919.88ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 65.6MB in the beginning and 48.1MB in the end (delta: 17.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:52,883 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.23ms. Allocated memory is still 155.2MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.47ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 81.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.96ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 80.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 250.98ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 65.8MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 2919.88ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 65.6MB in the beginning and 48.1MB in the end (delta: 17.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 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, 23 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 5 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital112 mio100 ax100 hnf100 lsp217 ukn44 mio100 lsp89 div100 bol112 ite100 ukn100 eq178 hnf99 smp100 dnf474 smp28 tf100 neg100 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 68ms VariablesStem: 1 VariablesLoop: 2 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]: 149, Number of transitions in reduction automaton: 35, Number of states in reduction automaton: 24, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i_4 + 5 and consists of 4 locations. One deterministic module has affine ranking function 5 + -2 * i_8 and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:54:52,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...