/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/counter-determinism.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:29,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:29,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:29,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:29,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:29,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:29,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:29,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:29,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:29,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:29,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:29,891 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:29,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:29,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:29,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:29,892 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:29,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:29,892 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:29,892 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:29,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:29,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:29,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:29,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:29,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:29,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:29,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:29,892 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:29,892 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:29,893 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:30,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:30,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:30,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:30,121 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:30,121 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:30,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/counter-determinism.wvr.bpl [2025-04-26 18:41:30,122 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/counter-determinism.wvr.bpl' [2025-04-26 18:41:30,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:30,138 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:30,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:30,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:30,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:30,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:30" (1/1) ... [2025-04-26 18:41:30,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:30" (1/1) ... [2025-04-26 18:41:30,172 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:30,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:30,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:30,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:30,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:30,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:30" (1/1) ... [2025-04-26 18:41:30,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:30" (1/1) ... [2025-04-26 18:41:30,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:30" (1/1) ... [2025-04-26 18:41:30,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:30" (1/1) ... [2025-04-26 18:41:30,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:30" (1/1) ... [2025-04-26 18:41:30,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:30" (1/1) ... [2025-04-26 18:41:30,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:30" (1/1) ... [2025-04-26 18:41:30,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:30" (1/1) ... [2025-04-26 18:41:30,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:30" (1/1) ... [2025-04-26 18:41:30,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:30,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:30,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:30,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:30,199 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:30" (1/1) ... [2025-04-26 18:41:30,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:30,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:30,222 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:41:30,224 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:41:30,244 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:30,245 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:30,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:30,245 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:30,245 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:30,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:30,245 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:30,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:30,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:30,245 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:30,245 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:30,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:30,245 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:41:30,245 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:41:30,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:41:30,246 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:41:30,283 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:30,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:30,380 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:30,381 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:30,406 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:30,406 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:30,407 INFO L201 PluginConnector]: Adding new model counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:30 BoogieIcfgContainer [2025-04-26 18:41:30,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:30,408 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:30,408 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:30,413 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:30,414 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:30,414 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:30" (1/2) ... [2025-04-26 18:41:30,415 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56b8632f and model type counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:30, skipping insertion in model container [2025-04-26 18:41:30,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:30,415 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:30" (2/2) ... [2025-04-26 18:41:30,416 INFO L376 chiAutomizerObserver]: Analyzing ICFG counter-determinism.wvr.bpl [2025-04-26 18:41:30,465 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:41:30,498 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:30,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:30,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:30,500 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:41:30,501 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:41:30,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 114 flow [2025-04-26 18:41:30,566 INFO L116 PetriNetUnfolderBase]: 4/35 cut-off events. [2025-04-26 18:41:30,568 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:41:30,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 35 events. 4/35 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-04-26 18:41:30,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 43 transitions, 114 flow [2025-04-26 18:41:30,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 35 transitions, 94 flow [2025-04-26 18:41:30,573 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 44 places, 35 transitions, 94 flow [2025-04-26 18:41:30,574 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 94 flow [2025-04-26 18:41:30,617 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 437 states, 435 states have (on average 3.8183908045977013) internal successors, (in total 1661), 436 states have internal predecessors, (1661), 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:41:30,618 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 437 states, 435 states have (on average 3.8183908045977013) internal successors, (in total 1661), 436 states have internal predecessors, (1661), 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:41:30,621 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:30,777 WARN L140 AmpleReduction]: Number of pruned transitions: 543 [2025-04-26 18:41:30,777 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:30,777 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 186 [2025-04-26 18:41:30,777 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:31 [2025-04-26 18:41:30,777 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:219 [2025-04-26 18:41:30,777 WARN L145 AmpleReduction]: Times succ was already a loop node:370 [2025-04-26 18:41:30,777 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:18 [2025-04-26 18:41:30,777 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:30,781 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 437 states, 435 states have (on average 2.5701149425287357) internal successors, (in total 1118), 436 states have internal predecessors, (1118), 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:41:30,788 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:30,789 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:30,789 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:30,789 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:30,789 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:30,789 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:30,789 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:30,789 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:30,791 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 437 states, 435 states have (on average 2.5701149425287357) internal successors, (in total 1118), 436 states have internal predecessors, (1118), 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:41:30,819 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 380 [2025-04-26 18:41:30,819 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:30,820 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:30,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:30,825 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:30,825 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:30,827 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 437 states, 435 states have (on average 2.5701149425287357) internal successors, (in total 1118), 436 states have internal predecessors, (1118), 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:41:30,838 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 380 [2025-04-26 18:41:30,839 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:30,839 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:30,839 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:30,839 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:30,847 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L68: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[81] L68-->L69: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[67] L69-->L70: Formula: (= v_counter1_7 0) InVars {counter1=v_counter1_7} OutVars{counter1=v_counter1_7} AuxVars[] AssignedVars[]" "[91] L70-->L71: Formula: (= v_j1_1 0) InVars {j1=v_j1_1} OutVars{j1=v_j1_1} AuxVars[] AssignedVars[]" "[61] L71-->L72: Formula: (= v_j2_1 0) InVars {j2=v_j2_1} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[]" "[90] L72-->L73: Formula: (= v_counter2_2 0) InVars {counter2=v_counter2_2} OutVars{counter2=v_counter2_2} AuxVars[] AssignedVars[]" "[88] L73-->L74: 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[]" "[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:30,847 INFO L754 eck$LassoCheckResult]: Loop: "[95] L22-1-->L22: 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[]" "[97] L22-->L22-1: Formula: (and (= v_counter1_8 (+ v_counter1_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter1=v_counter1_9} OutVars{i1=v_i1_6, counter1=v_counter1_8} AuxVars[] AssignedVars[counter1, i1]" [2025-04-26 18:41:30,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:30,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1372166775, now seen corresponding path program 1 times [2025-04-26 18:41:30,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:30,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179235824] [2025-04-26 18:41:30,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:30,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:30,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:30,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:30,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:30,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:30,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:30,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:30,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:30,926 INFO L85 PathProgramCache]: Analyzing trace with hash 4003, now seen corresponding path program 1 times [2025-04-26 18:41:30,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:30,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776588454] [2025-04-26 18:41:30,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:30,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:30,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:30,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:30,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:30,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:30,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:30,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:30,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:30,940 INFO L85 PathProgramCache]: Analyzing trace with hash -97307861, now seen corresponding path program 1 times [2025-04-26 18:41:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:30,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689287496] [2025-04-26 18:41:30,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:30,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:30,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:30,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,947 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:30,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:30,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:30,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:31,035 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:31,035 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:31,038 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:31,038 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:31,038 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:31,038 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,038 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:31,038 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:31,039 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:41:31,039 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:31,039 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:31,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,149 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:31,149 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:31,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,160 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:41:31,162 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:41:31,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:31,163 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:31,182 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:41:31,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,184 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:41:31,185 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:41:31,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:31,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:31,215 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:31,215 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter1=0} Honda state: {counter1=0} Generalized eigenvectors: [{counter1=-3}, {counter1=-3}, {counter1=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 18:41:31,222 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:41:31,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,224 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:41:31,226 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:41:31,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:31,227 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:31,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:41:31,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,248 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:41:31,250 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:41:31,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:31,251 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:31,317 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:31,322 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:41:31,322 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:31,323 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:31,323 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:31,323 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:31,323 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:31,323 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,323 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:31,323 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:31,323 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:41:31,323 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:31,323 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:31,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,356 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:31,359 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:31,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,362 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:41:31,363 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:41:31,365 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:41:31,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:31,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:31,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:31,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:31,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:31,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:31,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:31,381 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:31,387 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:41:31,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,389 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:41:31,391 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:41:31,392 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:41:31,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:31,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:31,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:31,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:31,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:31,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:31,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:31,406 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:31,410 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:31,410 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:31,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,413 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:41:31,415 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:41:31,416 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:31,418 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:41:31,419 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:41:31,419 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:31,419 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:31,420 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N1, i1) = 1*N1 - 1*i1 Supporting invariants [] [2025-04-26 18:41:31,425 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:41:31,427 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:31,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:31,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:31,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:31,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:31,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:31,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:31,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:31,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:31,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:31,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:31,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:31,474 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:31,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:31,496 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:41:31,515 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:41:31,517 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 437 states, 435 states have (on average 2.5701149425287357) internal successors, (in total 1118), 436 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:31,617 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 437 states, 435 states have (on average 2.5701149425287357) internal successors, (in total 1118), 436 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1030 states and 2649 transitions. Complement of second has 7 states. [2025-04-26 18:41:31,618 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:41:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-04-26 18:41:31,624 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:41:31,624 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:31,625 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:41:31,625 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:31,625 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:41:31,625 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:31,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1030 states and 2649 transitions. [2025-04-26 18:41:31,636 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 210 [2025-04-26 18:41:31,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1030 states to 538 states and 1378 transitions. [2025-04-26 18:41:31,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 231 [2025-04-26 18:41:31,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 346 [2025-04-26 18:41:31,650 INFO L74 IsDeterministic]: Start isDeterministic. Operand 538 states and 1378 transitions. [2025-04-26 18:41:31,650 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:31,650 INFO L218 hiAutomatonCegarLoop]: Abstraction has 538 states and 1378 transitions. [2025-04-26 18:41:31,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states and 1378 transitions. [2025-04-26 18:41:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 463. [2025-04-26 18:41:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 463 states have (on average 2.5593952483801297) internal successors, (in total 1185), 462 states have internal predecessors, (1185), 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:41:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1185 transitions. [2025-04-26 18:41:31,696 INFO L240 hiAutomatonCegarLoop]: Abstraction has 463 states and 1185 transitions. [2025-04-26 18:41:31,696 INFO L438 stractBuchiCegarLoop]: Abstraction has 463 states and 1185 transitions. [2025-04-26 18:41:31,696 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:31,696 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 463 states and 1185 transitions. [2025-04-26 18:41:31,698 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 210 [2025-04-26 18:41:31,698 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:31,698 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:31,699 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:31,700 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:31,700 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L68: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[81] L68-->L69: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[67] L69-->L70: Formula: (= v_counter1_7 0) InVars {counter1=v_counter1_7} OutVars{counter1=v_counter1_7} AuxVars[] AssignedVars[]" "[91] L70-->L71: Formula: (= v_j1_1 0) InVars {j1=v_j1_1} OutVars{j1=v_j1_1} AuxVars[] AssignedVars[]" "[61] L71-->L72: Formula: (= v_j2_1 0) InVars {j2=v_j2_1} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[]" "[90] L72-->L73: Formula: (= v_counter2_2 0) InVars {counter2=v_counter2_2} OutVars{counter2=v_counter2_2} AuxVars[] AssignedVars[]" "[88] L73-->L74: 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[]" "[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[94] L22-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_4) InVars {i1=v_i1_4, N1=v_N1_2} OutVars{i1=v_i1_4, N1=v_N1_2} AuxVars[] AssignedVars[]" "[96] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[115] L74-1-->L33-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:41:31,700 INFO L754 eck$LassoCheckResult]: Loop: "[99] L33-1-->L33: 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[]" "[101] L33-->L33-1: Formula: (and (< 0 v_counter1_17) (= (+ v_counter1_16 1) v_counter1_17) (= v_i2_10 (+ v_i2_11 1))) InVars {counter1=v_counter1_17, i2=v_i2_11} OutVars{counter1=v_counter1_16, i2=v_i2_10} AuxVars[] AssignedVars[counter1, i2]" [2025-04-26 18:41:31,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:31,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1278422728, now seen corresponding path program 1 times [2025-04-26 18:41:31,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:31,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013709887] [2025-04-26 18:41:31,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:31,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:31,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:31,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:31,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:31,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:31,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:31,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:31,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:31,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:31,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:31,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:31,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:31,714 INFO L85 PathProgramCache]: Analyzing trace with hash 4131, now seen corresponding path program 1 times [2025-04-26 18:41:31,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:31,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113620702] [2025-04-26 18:41:31,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:31,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:31,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:31,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:31,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:31,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:31,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:31,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:31,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:31,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:31,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:31,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:31,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:31,724 INFO L85 PathProgramCache]: Analyzing trace with hash 203598122, now seen corresponding path program 1 times [2025-04-26 18:41:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:31,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746091362] [2025-04-26 18:41:31,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:31,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:31,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:31,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:31,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:31,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:31,788 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:41:31,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:31,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746091362] [2025-04-26 18:41:31,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746091362] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:31,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:31,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:41:31,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053265269] [2025-04-26 18:41:31,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:31,821 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:31,821 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:31,821 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:31,821 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:31,822 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:31,822 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,822 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:31,822 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:31,822 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:41:31,822 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:31,822 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:31,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,854 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:31,854 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:31,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,856 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:41:31,858 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:41:31,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:31,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:31,875 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:41:31,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,877 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:31,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:41:31,880 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:31,880 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:31,902 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:31,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:41:31,907 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:31,907 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:31,907 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:31,907 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:31,908 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:31,908 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,908 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:31,908 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:31,908 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:41:31,908 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:31,908 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:31,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,945 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:31,945 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:31,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,947 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:31,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:41:31,949 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:41:31,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:31,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:31,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:31,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:31,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:31,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:31,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:31,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:31,964 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:41:31,964 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:31,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,966 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:31,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:41:31,967 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:31,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:41:31,970 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:31,970 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:31,970 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter1) = 1*counter1 Supporting invariants [] [2025-04-26 18:41:31,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:41:31,976 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:31,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:31,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:31,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:31,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:31,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:31,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:31,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:32,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:32,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:32,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:32,020 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:32,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:32,022 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:41:32,023 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 18:41:32,023 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 463 states and 1185 transitions. cyclomatic complexity: 829 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:41:32,058 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 463 states and 1185 transitions. cyclomatic complexity: 829. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 819 states and 1993 transitions. Complement of second has 5 states. [2025-04-26 18:41:32,060 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 18:41:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:41:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-26 18:41:32,061 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:41:32,061 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:32,061 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:41:32,061 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:32,061 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:41:32,062 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:32,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 819 states and 1993 transitions. [2025-04-26 18:41:32,068 INFO L131 ngComponentsAnalysis]: Automaton has 103 accepting balls. 276 [2025-04-26 18:41:32,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 819 states to 650 states and 1611 transitions. [2025-04-26 18:41:32,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2025-04-26 18:41:32,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 385 [2025-04-26 18:41:32,075 INFO L74 IsDeterministic]: Start isDeterministic. Operand 650 states and 1611 transitions. [2025-04-26 18:41:32,075 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:32,075 INFO L218 hiAutomatonCegarLoop]: Abstraction has 650 states and 1611 transitions. [2025-04-26 18:41:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states and 1611 transitions. [2025-04-26 18:41:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 550. [2025-04-26 18:41:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 550 states have (on average 2.5545454545454547) internal successors, (in total 1405), 549 states have internal predecessors, (1405), 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:41:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1405 transitions. [2025-04-26 18:41:32,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 550 states and 1405 transitions. [2025-04-26 18:41:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:32,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:41:32,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:41:32,107 INFO L87 Difference]: Start difference. First operand 550 states and 1405 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:41:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:32,144 INFO L93 Difference]: Finished difference Result 601 states and 1493 transitions. [2025-04-26 18:41:32,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 601 states and 1493 transitions. [2025-04-26 18:41:32,147 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 250 [2025-04-26 18:41:32,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 601 states to 599 states and 1491 transitions. [2025-04-26 18:41:32,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 333 [2025-04-26 18:41:32,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 333 [2025-04-26 18:41:32,162 INFO L74 IsDeterministic]: Start isDeterministic. Operand 599 states and 1491 transitions. [2025-04-26 18:41:32,163 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:32,163 INFO L218 hiAutomatonCegarLoop]: Abstraction has 599 states and 1491 transitions. [2025-04-26 18:41:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states and 1491 transitions. [2025-04-26 18:41:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 553. [2025-04-26 18:41:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 553 states have (on average 2.546112115732369) internal successors, (in total 1408), 552 states have internal predecessors, (1408), 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:41:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 1408 transitions. [2025-04-26 18:41:32,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 553 states and 1408 transitions. [2025-04-26 18:41:32,179 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:41:32,180 INFO L438 stractBuchiCegarLoop]: Abstraction has 553 states and 1408 transitions. [2025-04-26 18:41:32,180 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:32,180 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 553 states and 1408 transitions. [2025-04-26 18:41:32,183 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 210 [2025-04-26 18:41:32,183 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:32,183 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:32,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:32,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:32,184 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L68: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[81] L68-->L69: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[67] L69-->L70: Formula: (= v_counter1_7 0) InVars {counter1=v_counter1_7} OutVars{counter1=v_counter1_7} AuxVars[] AssignedVars[]" "[91] L70-->L71: Formula: (= v_j1_1 0) InVars {j1=v_j1_1} OutVars{j1=v_j1_1} AuxVars[] AssignedVars[]" "[61] L71-->L72: Formula: (= v_j2_1 0) InVars {j2=v_j2_1} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[]" "[90] L72-->L73: Formula: (= v_counter2_2 0) InVars {counter2=v_counter2_2} OutVars{counter2=v_counter2_2} AuxVars[] AssignedVars[]" "[88] L73-->L74: 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[]" "[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[95] L22-1-->L22: 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[]" "[115] L74-1-->L33-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]" "[97] L22-->L22-1: Formula: (and (= v_counter1_8 (+ v_counter1_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter1=v_counter1_9} OutVars{i1=v_i1_6, counter1=v_counter1_8} AuxVars[] AssignedVars[counter1, i1]" "[94] L22-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_4) InVars {i1=v_i1_4, N1=v_N1_2} OutVars{i1=v_i1_4, N1=v_N1_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:32,184 INFO L754 eck$LassoCheckResult]: Loop: "[99] L33-1-->L33: 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[]" "[101] L33-->L33-1: Formula: (and (< 0 v_counter1_17) (= (+ v_counter1_16 1) v_counter1_17) (= v_i2_10 (+ v_i2_11 1))) InVars {counter1=v_counter1_17, i2=v_i2_11} OutVars{counter1=v_counter1_16, i2=v_i2_10} AuxVars[] AssignedVars[counter1, i2]" [2025-04-26 18:41:32,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,185 INFO L85 PathProgramCache]: Analyzing trace with hash 976446490, now seen corresponding path program 1 times [2025-04-26 18:41:32,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:32,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132092236] [2025-04-26 18:41:32,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:32,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:32,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:32,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:32,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:32,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:32,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:32,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:32,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,202 INFO L85 PathProgramCache]: Analyzing trace with hash 4131, now seen corresponding path program 2 times [2025-04-26 18:41:32,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:32,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356627147] [2025-04-26 18:41:32,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:32,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:32,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:32,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:32,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:32,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:32,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:32,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:32,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:32,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2062209532, now seen corresponding path program 1 times [2025-04-26 18:41:32,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:32,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873094216] [2025-04-26 18:41:32,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:32,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:32,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:32,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:32,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,214 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:32,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:32,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:32,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:32,254 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:32,254 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:32,254 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:32,254 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:32,254 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:32,254 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,254 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:32,254 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:32,254 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:41:32,254 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:32,254 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:32,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,286 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:32,287 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:32,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,289 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:41:32,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:32,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:32,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:32,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,310 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:41:32,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:32,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:32,375 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:32,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:41:32,380 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:32,380 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:32,380 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:32,381 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:32,381 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:32,381 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,381 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:32,381 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:32,381 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:41:32,381 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:32,381 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:32,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,412 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:32,412 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:32,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,414 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:41:32,417 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:41:32,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:32,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:32,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:32,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:32,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:32,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:32,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:32,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:32,432 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:32,432 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:32,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,434 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:41:32,435 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:32,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:41:32,438 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:32,438 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:32,438 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, i2) = 1*N2 - 1*i2 Supporting invariants [] [2025-04-26 18:41:32,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:32,444 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:32,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:32,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:32,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:32,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:32,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:32,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:32,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:32,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:32,484 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:32,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:32,501 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:41:32,501 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:41:32,501 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 553 states and 1408 transitions. cyclomatic complexity: 976 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:32,578 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 553 states and 1408 transitions. cyclomatic complexity: 976. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1250 states and 3356 transitions. Complement of second has 6 states. [2025-04-26 18:41:32,578 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:41:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2025-04-26 18:41:32,579 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 74 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:41:32,579 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:32,579 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 74 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:41:32,579 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:32,579 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 74 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 18:41:32,579 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:32,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1250 states and 3356 transitions. [2025-04-26 18:41:32,589 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 94 [2025-04-26 18:41:32,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1250 states to 836 states and 2132 transitions. [2025-04-26 18:41:32,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2025-04-26 18:41:32,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 421 [2025-04-26 18:41:32,596 INFO L74 IsDeterministic]: Start isDeterministic. Operand 836 states and 2132 transitions. [2025-04-26 18:41:32,596 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:32,596 INFO L218 hiAutomatonCegarLoop]: Abstraction has 836 states and 2132 transitions. [2025-04-26 18:41:32,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states and 2132 transitions. [2025-04-26 18:41:32,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 605. [2025-04-26 18:41:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 605 states have (on average 2.6545454545454548) internal successors, (in total 1606), 604 states have internal predecessors, (1606), 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:41:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1606 transitions. [2025-04-26 18:41:32,618 INFO L240 hiAutomatonCegarLoop]: Abstraction has 605 states and 1606 transitions. [2025-04-26 18:41:32,618 INFO L438 stractBuchiCegarLoop]: Abstraction has 605 states and 1606 transitions. [2025-04-26 18:41:32,618 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:32,618 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 605 states and 1606 transitions. [2025-04-26 18:41:32,620 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 94 [2025-04-26 18:41:32,620 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:32,620 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:32,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:32,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:32,621 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L68: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[81] L68-->L69: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[67] L69-->L70: Formula: (= v_counter1_7 0) InVars {counter1=v_counter1_7} OutVars{counter1=v_counter1_7} AuxVars[] AssignedVars[]" "[91] L70-->L71: Formula: (= v_j1_1 0) InVars {j1=v_j1_1} OutVars{j1=v_j1_1} AuxVars[] AssignedVars[]" "[61] L71-->L72: Formula: (= v_j2_1 0) InVars {j2=v_j2_1} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[]" "[90] L72-->L73: Formula: (= v_counter2_2 0) InVars {counter2=v_counter2_2} OutVars{counter2=v_counter2_2} AuxVars[] AssignedVars[]" "[88] L73-->L74: 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[]" "[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[94] L22-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_4) InVars {i1=v_i1_4, N1=v_N1_2} OutVars{i1=v_i1_4, N1=v_N1_2} AuxVars[] AssignedVars[]" "[96] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[115] L74-1-->L33-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]" "[98] L33-1-->thread2FINAL: Formula: (<= v_N2_2 v_i2_4) InVars {N2=v_N2_2, i2=v_i2_4} OutVars{N2=v_N2_2, i2=v_i2_4} AuxVars[] AssignedVars[]" "[100] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[118] L75-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:41:32,621 INFO L754 eck$LassoCheckResult]: Loop: "[103] L45-1-->L45: Formula: (< v_j1_2 v_N1_4) InVars {j1=v_j1_2, N1=v_N1_4} OutVars{j1=v_j1_2, N1=v_N1_4} AuxVars[] AssignedVars[]" "[105] L45-->L45-1: Formula: (and (= v_j1_6 (+ v_j1_7 1)) (= v_counter2_8 (+ v_counter2_9 1))) InVars {counter2=v_counter2_9, j1=v_j1_7} OutVars{counter2=v_counter2_8, j1=v_j1_6} AuxVars[] AssignedVars[counter2, j1]" [2025-04-26 18:41:32,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2016573612, now seen corresponding path program 1 times [2025-04-26 18:41:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:32,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347038048] [2025-04-26 18:41:32,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:32,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:32,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:32,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:32,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:32,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:32,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:32,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:32,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash 4259, now seen corresponding path program 1 times [2025-04-26 18:41:32,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:32,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731232230] [2025-04-26 18:41:32,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:32,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:32,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:32,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:32,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:32,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:32,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:32,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:32,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:32,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,634 INFO L85 PathProgramCache]: Analyzing trace with hash 896993934, now seen corresponding path program 1 times [2025-04-26 18:41:32,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:32,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746772903] [2025-04-26 18:41:32,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:32,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:32,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:41:32,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:41:32,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:32,672 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:41:32,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:32,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746772903] [2025-04-26 18:41:32,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746772903] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:32,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:32,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:41:32,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480281194] [2025-04-26 18:41:32,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:32,687 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:32,687 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:32,687 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:32,687 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:32,687 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:32,687 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,687 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:32,687 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:32,687 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 18:41:32,687 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:32,687 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:32,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,709 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:32,709 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:32,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,711 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:41:32,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:32,714 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:32,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:41:32,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,732 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:41:32,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:32,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:32,798 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:32,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:41:32,803 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:32,803 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:32,803 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:32,803 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:32,803 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:32,803 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,803 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:32,803 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:32,803 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 18:41:32,803 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:32,803 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:32,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:32,827 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:32,827 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:32,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,831 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:41:32,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:32,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:32,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:32,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:32,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:32,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:32,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:32,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:32,846 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:32,847 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:41:32,847 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:32,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:32,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:32,849 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:32,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:41:32,852 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:32,854 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:41:32,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:41:32,855 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:32,855 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:32,855 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N1, j1) = 1*N1 - 1*j1 Supporting invariants [] [2025-04-26 18:41:32,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:32,862 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:32,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:32,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:32,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:32,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:32,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:32,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:32,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:32,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:32,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:32,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:32,907 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:32,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:32,923 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:41:32,923 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:41:32,923 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 605 states and 1606 transitions. cyclomatic complexity: 1092 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:33,008 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 605 states and 1606 transitions. cyclomatic complexity: 1092. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1608 states and 4360 transitions. Complement of second has 6 states. [2025-04-26 18:41:33,009 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:41:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-04-26 18:41:33,010 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:41:33,010 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:33,010 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 18:41:33,010 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:33,010 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 18:41:33,010 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:33,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1608 states and 4360 transitions. [2025-04-26 18:41:33,021 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:41:33,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1608 states to 757 states and 2001 transitions. [2025-04-26 18:41:33,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2025-04-26 18:41:33,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2025-04-26 18:41:33,027 INFO L74 IsDeterministic]: Start isDeterministic. Operand 757 states and 2001 transitions. [2025-04-26 18:41:33,027 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:33,027 INFO L218 hiAutomatonCegarLoop]: Abstraction has 757 states and 2001 transitions. [2025-04-26 18:41:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states and 2001 transitions. [2025-04-26 18:41:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 703. [2025-04-26 18:41:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 703 states have (on average 2.588904694167852) internal successors, (in total 1820), 702 states have internal predecessors, (1820), 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:41:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1820 transitions. [2025-04-26 18:41:33,042 INFO L240 hiAutomatonCegarLoop]: Abstraction has 703 states and 1820 transitions. [2025-04-26 18:41:33,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:33,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:41:33,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:41:33,043 INFO L87 Difference]: Start difference. First operand 703 states and 1820 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:33,126 INFO L93 Difference]: Finished difference Result 726 states and 1847 transitions. [2025-04-26 18:41:33,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 726 states and 1847 transitions. [2025-04-26 18:41:33,130 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-04-26 18:41:33,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 726 states to 726 states and 1847 transitions. [2025-04-26 18:41:33,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2025-04-26 18:41:33,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 237 [2025-04-26 18:41:33,135 INFO L74 IsDeterministic]: Start isDeterministic. Operand 726 states and 1847 transitions. [2025-04-26 18:41:33,135 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:33,135 INFO L218 hiAutomatonCegarLoop]: Abstraction has 726 states and 1847 transitions. [2025-04-26 18:41:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states and 1847 transitions. [2025-04-26 18:41:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 707. [2025-04-26 18:41:33,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 707 states have (on average 2.5799151343705797) internal successors, (in total 1824), 706 states have internal predecessors, (1824), 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:41:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1824 transitions. [2025-04-26 18:41:33,146 INFO L240 hiAutomatonCegarLoop]: Abstraction has 707 states and 1824 transitions. [2025-04-26 18:41:33,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 18:41:33,147 INFO L438 stractBuchiCegarLoop]: Abstraction has 707 states and 1824 transitions. [2025-04-26 18:41:33,147 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:33,147 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 707 states and 1824 transitions. [2025-04-26 18:41:33,150 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:41:33,150 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:33,150 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:33,150 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:33,150 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:33,151 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L68: Formula: (= v_i1_5 0) InVars {i1=v_i1_5} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[]" "[81] L68-->L69: Formula: (= v_i2_5 0) InVars {i2=v_i2_5} OutVars{i2=v_i2_5} AuxVars[] AssignedVars[]" "[67] L69-->L70: Formula: (= v_counter1_7 0) InVars {counter1=v_counter1_7} OutVars{counter1=v_counter1_7} AuxVars[] AssignedVars[]" "[91] L70-->L71: Formula: (= v_j1_1 0) InVars {j1=v_j1_1} OutVars{j1=v_j1_1} AuxVars[] AssignedVars[]" "[61] L71-->L72: Formula: (= v_j2_1 0) InVars {j2=v_j2_1} OutVars{j2=v_j2_1} AuxVars[] AssignedVars[]" "[90] L72-->L73: Formula: (= v_counter2_2 0) InVars {counter2=v_counter2_2} OutVars{counter2=v_counter2_2} AuxVars[] AssignedVars[]" "[88] L73-->L74: 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[]" "[112] L74-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[95] L22-1-->L22: 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[]" "[115] L74-1-->L33-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]" "[97] L22-->L22-1: Formula: (and (= v_counter1_8 (+ v_counter1_9 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter1=v_counter1_9} OutVars{i1=v_i1_6, counter1=v_counter1_8} AuxVars[] AssignedVars[counter1, i1]" "[118] L75-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[94] L22-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_4) InVars {i1=v_i1_4, N1=v_N1_2} OutVars{i1=v_i1_4, N1=v_N1_2} AuxVars[] AssignedVars[]" "[121] L76-->L56-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[98] L33-1-->thread2FINAL: Formula: (<= v_N2_2 v_i2_4) InVars {N2=v_N2_2, i2=v_i2_4} OutVars{N2=v_N2_2, i2=v_i2_4} AuxVars[] AssignedVars[]" "[102] L45-1-->thread3FINAL: Formula: (<= v_N1_5 v_j1_5) InVars {j1=v_j1_5, N1=v_N1_5} OutVars{j1=v_j1_5, N1=v_N1_5} AuxVars[] AssignedVars[]" [2025-04-26 18:41:33,151 INFO L754 eck$LassoCheckResult]: Loop: "[107] L56-1-->L56: Formula: (< v_j2_5 v_N2_5) InVars {j2=v_j2_5, N2=v_N2_5} OutVars{j2=v_j2_5, N2=v_N2_5} AuxVars[] AssignedVars[]" "[109] L56-->L56-1: Formula: (and (= (+ v_counter2_16 1) v_counter2_17) (< 0 v_counter2_17) (= (+ v_j2_11 1) v_j2_10)) InVars {j2=v_j2_11, counter2=v_counter2_17} OutVars{j2=v_j2_10, counter2=v_counter2_16} AuxVars[] AssignedVars[counter2, j2]" [2025-04-26 18:41:33,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1825474705, now seen corresponding path program 1 times [2025-04-26 18:41:33,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:33,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858945372] [2025-04-26 18:41:33,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:33,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:33,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:41:33,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:41:33,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:33,242 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:41:33,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:33,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858945372] [2025-04-26 18:41:33,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858945372] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:33,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:33,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:41:33,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379895403] [2025-04-26 18:41:33,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:33,243 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:33,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash 4387, now seen corresponding path program 1 times [2025-04-26 18:41:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:33,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194408832] [2025-04-26 18:41:33,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:33,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:33,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:33,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:33,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:33,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:33,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:33,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:33,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:33,265 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:33,266 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:33,266 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:33,266 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:33,266 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:33,266 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,266 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:33,266 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:33,266 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_petrified1_Iteration5_Loop [2025-04-26 18:41:33,266 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:33,266 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:33,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,291 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:33,291 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:33,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,293 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:33,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:41:33,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:33,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:33,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:33,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,313 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:33,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:41:33,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:33,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:33,336 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:33,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:33,340 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:33,340 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:33,340 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:33,341 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:33,341 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:33,341 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,341 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:33,341 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:33,341 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-determinism.wvr.bpl_petrified1_Iteration5_Loop [2025-04-26 18:41:33,341 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:33,341 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:33,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:33,367 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:33,367 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:33,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,369 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:33,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:41:33,371 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:41:33,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:33,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:33,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:33,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:33,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:33,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:33,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:33,383 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:33,384 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:41:33,384 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:33,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:33,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:33,387 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:33,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:41:33,388 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:33,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:41:33,391 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:33,391 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:33,391 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter2) = 1*counter2 Supporting invariants [] [2025-04-26 18:41:33,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:41:33,396 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:33,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:33,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:41:33,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:41:33,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:33,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:33,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:33,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:33,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:33,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:33,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:33,442 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:33,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:33,443 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:41:33,444 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 18:41:33,444 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 707 states and 1824 transitions. cyclomatic complexity: 1198 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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:41:33,470 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 707 states and 1824 transitions. cyclomatic complexity: 1198. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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 1125 states and 2822 transitions. Complement of second has 4 states. [2025-04-26 18:41:33,470 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 18:41:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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:41:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-04-26 18:41:33,472 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 18:41:33,473 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:33,473 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 18 letters. Loop has 2 letters. [2025-04-26 18:41:33,473 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:33,473 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 16 letters. Loop has 4 letters. [2025-04-26 18:41:33,473 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:33,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1125 states and 2822 transitions. [2025-04-26 18:41:33,480 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:33,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1125 states to 0 states and 0 transitions. [2025-04-26 18:41:33,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:33,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:33,481 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:33,481 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:33,481 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:33,481 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:33,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:33,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:41:33,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:41:33,481 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (in total 16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:33,481 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:41:33,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:41:33,481 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:33,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:41:33,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:33,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:33,481 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:33,481 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:33,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:33,482 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:33,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:41:33,484 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:33,484 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:33,484 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:33,484 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:33,484 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:33,495 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:41:33,496 INFO L201 PluginConnector]: Adding new model counter-determinism.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:33 BoogieIcfgContainer [2025-04-26 18:41:33,496 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:33,497 INFO L158 Benchmark]: Toolchain (without parser) took 3358.77ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 51.3MB in the end (delta: 31.1MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:33,497 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:33,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.00ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 80.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:33,497 INFO L158 Benchmark]: Boogie Preprocessor took 24.47ms. Allocated memory is still 155.2MB. Free memory was 80.4MB in the beginning and 79.4MB in the end (delta: 974.0kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:33,497 INFO L158 Benchmark]: RCFGBuilder took 208.85ms. Allocated memory is still 155.2MB. Free memory was 79.3MB in the beginning and 69.0MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:33,498 INFO L158 Benchmark]: BuchiAutomizer took 3088.22ms. Allocated memory is still 155.2MB. Free memory was 68.9MB in the beginning and 51.3MB in the end (delta: 17.6MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. [2025-04-26 18:41:33,500 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.16ms. Allocated memory is still 155.2MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.00ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 80.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.47ms. Allocated memory is still 155.2MB. Free memory was 80.4MB in the beginning and 79.4MB in the end (delta: 974.0kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 208.85ms. Allocated memory is still 155.2MB. Free memory was 79.3MB in the beginning and 69.0MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3088.22ms. Allocated memory is still 155.2MB. Free memory was 68.9MB in the beginning and 51.3MB in the end (delta: 17.6MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 525 StatesRemovedByMinimization, 6 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 [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 306 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 332 IncrementalHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 167 mSDtfsCounter, 332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 284, Number of transitions in reduction automaton: 1118, Number of states in reduction automaton: 437, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 5 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 counter1 and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. One deterministic module has affine ranking function -1 * j1 + N1 and consists of 4 locations. One deterministic module has affine ranking function counter2 and consists of 3 locations. 3 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:41:33,511 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...