/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/threaded-sum-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:45,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:45,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:45,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:45,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:45,897 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:45,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:45,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:45,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:45,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:45,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:45,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:45,920 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:45,920 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:45,920 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:45,920 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:45,920 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:45,921 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:45,921 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:45,921 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:45,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:45,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:45,921 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:45,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:45,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:45,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:45,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:45,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:45,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:45,921 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:45,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:45,922 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:45,922 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:45,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:45,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:45,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:45,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:45,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:45,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:45,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:45,922 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:45,923 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:45,923 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:46,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:46,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:46,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:46,160 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:46,161 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:46,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/threaded-sum-3.wvr.bpl [2025-04-26 18:41:46,162 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/threaded-sum-3.wvr.bpl' [2025-04-26 18:41:46,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:46,186 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:46,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:46,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:46,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:46,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:46" (1/1) ... [2025-04-26 18:41:46,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:46" (1/1) ... [2025-04-26 18:41:46,219 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:46,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:46,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:46,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:46,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:46,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:46" (1/1) ... [2025-04-26 18:41:46,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:46" (1/1) ... [2025-04-26 18:41:46,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:46" (1/1) ... [2025-04-26 18:41:46,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:46" (1/1) ... [2025-04-26 18:41:46,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:46" (1/1) ... [2025-04-26 18:41:46,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:46" (1/1) ... [2025-04-26 18:41:46,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:46" (1/1) ... [2025-04-26 18:41:46,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:46" (1/1) ... [2025-04-26 18:41:46,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:46" (1/1) ... [2025-04-26 18:41:46,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:46,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:46,253 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:46,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:46,254 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:46" (1/1) ... [2025-04-26 18:41:46,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:46,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:46,277 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:46,282 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:46,304 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:46,304 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:46,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:46,305 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:46,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:46,305 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:46,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:46,305 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:46,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:46,306 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:46,344 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:46,346 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:46,465 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:46,466 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:46,489 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:46,490 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:46,490 INFO L201 PluginConnector]: Adding new model threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:46 BoogieIcfgContainer [2025-04-26 18:41:46,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:46,493 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:46,493 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:46,498 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:46,498 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:46,498 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:46" (1/2) ... [2025-04-26 18:41:46,499 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a7d9516 and model type threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:46, skipping insertion in model container [2025-04-26 18:41:46,499 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:46,499 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:46" (2/2) ... [2025-04-26 18:41:46,500 INFO L376 chiAutomizerObserver]: Analyzing ICFG threaded-sum-3.wvr.bpl [2025-04-26 18:41:46,549 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:41:46,588 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:46,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:46,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:46,592 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:46,594 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:46,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 38 transitions, 97 flow [2025-04-26 18:41:46,662 INFO L116 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-04-26 18:41:46,663 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:41:46,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 5/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 23. Up to 3 conditions per place. [2025-04-26 18:41:46,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 38 transitions, 97 flow [2025-04-26 18:41:46,668 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 32 transitions, 82 flow [2025-04-26 18:41:46,669 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 37 places, 32 transitions, 82 flow [2025-04-26 18:41:46,669 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 32 transitions, 82 flow [2025-04-26 18:41:46,690 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 138 states, 136 states have (on average 3.1838235294117645) internal successors, (in total 433), 137 states have internal predecessors, (433), 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:46,691 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 138 states, 136 states have (on average 3.1838235294117645) internal successors, (in total 433), 137 states have internal predecessors, (433), 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:46,692 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:46,836 WARN L140 AmpleReduction]: Number of pruned transitions: 129 [2025-04-26 18:41:46,836 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:46,836 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 14 [2025-04-26 18:41:46,836 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:52 [2025-04-26 18:41:46,837 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:63 [2025-04-26 18:41:46,837 WARN L145 AmpleReduction]: Times succ was already a loop node:63 [2025-04-26 18:41:46,837 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:10 [2025-04-26 18:41:46,837 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:46,837 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 130 states, 128 states have (on average 2.1015625) internal successors, (in total 269), 129 states have internal predecessors, (269), 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:46,843 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:46,843 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:46,843 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:46,843 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:46,843 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:46,843 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:46,843 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:46,843 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:46,846 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 128 states have (on average 2.1015625) internal successors, (in total 269), 129 states have internal predecessors, (269), 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:46,860 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 78 [2025-04-26 18:41:46,860 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:46,860 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:46,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:46,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:46,864 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:46,864 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 128 states have (on average 2.1015625) internal successors, (in total 269), 129 states have internal predecessors, (269), 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:46,873 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 78 [2025-04-26 18:41:46,873 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:46,873 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:46,874 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:46,874 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:46,880 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L65: Formula: (= v_m_4 0) InVars {m=v_m_4} OutVars{m=v_m_4} AuxVars[] AssignedVars[]" "[87] L65-->L66: Formula: (< 0 v_T_3) InVars {T=v_T_3} OutVars{T=v_T_3} AuxVars[] AssignedVars[]" "[60] L66-->L67: Formula: (< 0 v_S_3) InVars {S=v_S_3} OutVars{S=v_S_3} AuxVars[] AssignedVars[]" "[67] L67-->L68: Formula: (< 0 v_U_3) InVars {U=v_U_3} OutVars{U=v_U_3} AuxVars[] AssignedVars[]" "[74] L68-->L69: Formula: (= v_T_1 v_t_9) InVars {t=v_t_9, T=v_T_1} OutVars{t=v_t_9, T=v_T_1} AuxVars[] AssignedVars[]" "[66] L69-->L70: Formula: (= v_S_1 v_s_9) InVars {s=v_s_9, S=v_S_1} OutVars{s=v_s_9, S=v_S_1} AuxVars[] AssignedVars[]" "[85] L70-->L71: Formula: (= v_U_1 v_u_5) InVars {u=v_u_5, U=v_U_1} OutVars{u=v_u_5, U=v_U_1} AuxVars[] AssignedVars[]" "[106] L71-->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:46,880 INFO L754 eck$LassoCheckResult]: Loop: "[90] L22-1-->L22: Formula: (or (< 0 v_s_1) (< 0 v_u_1) (< 0 v_t_1)) InVars {u=v_u_1, t=v_t_1, s=v_s_1} OutVars{u=v_u_1, t=v_t_1, s=v_s_1} AuxVars[] AssignedVars[]" "[92] L22-->L22-1: Formula: (<= v_s_5 0) InVars {s=v_s_5} OutVars{s=v_s_5} AuxVars[] AssignedVars[]" [2025-04-26 18:41:46,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1621897218, now seen corresponding path program 1 times [2025-04-26 18:41:46,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:46,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50845633] [2025-04-26 18:41:46,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:46,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:46,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:46,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:46,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:46,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:46,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:46,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:46,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 1 times [2025-04-26 18:41:46,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:46,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968642915] [2025-04-26 18:41:46,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:46,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:46,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:46,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:46,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,969 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:46,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:46,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:46,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:46,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,975 INFO L85 PathProgramCache]: Analyzing trace with hash 429904832, now seen corresponding path program 1 times [2025-04-26 18:41:46,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:46,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145834909] [2025-04-26 18:41:46,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:46,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:46,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:46,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:46,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:47,088 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:47,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:47,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145834909] [2025-04-26 18:41:47,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145834909] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:47,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:47,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:47,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332142858] [2025-04-26 18:41:47,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:47,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:47,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:41:47,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:41:47,188 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 2.1015625) internal successors, (in total 269), 129 states have internal predecessors, (269), 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 4 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 4 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:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:47,300 INFO L93 Difference]: Finished difference Result 174 states and 373 transitions. [2025-04-26 18:41:47,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 373 transitions. [2025-04-26 18:41:47,308 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 101 [2025-04-26 18:41:47,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 157 states and 341 transitions. [2025-04-26 18:41:47,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2025-04-26 18:41:47,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 157 [2025-04-26 18:41:47,319 INFO L74 IsDeterministic]: Start isDeterministic. Operand 157 states and 341 transitions. [2025-04-26 18:41:47,320 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:47,320 INFO L218 hiAutomatonCegarLoop]: Abstraction has 157 states and 341 transitions. [2025-04-26 18:41:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 341 transitions. [2025-04-26 18:41:47,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-04-26 18:41:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 2.171974522292994) internal successors, (in total 341), 156 states have internal predecessors, (341), 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:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 341 transitions. [2025-04-26 18:41:47,347 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 341 transitions. [2025-04-26 18:41:47,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:41:47,350 INFO L438 stractBuchiCegarLoop]: Abstraction has 157 states and 341 transitions. [2025-04-26 18:41:47,350 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:47,350 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 341 transitions. [2025-04-26 18:41:47,355 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 101 [2025-04-26 18:41:47,356 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:47,356 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:47,356 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:47,356 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:47,356 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L65: Formula: (= v_m_4 0) InVars {m=v_m_4} OutVars{m=v_m_4} AuxVars[] AssignedVars[]" "[87] L65-->L66: Formula: (< 0 v_T_3) InVars {T=v_T_3} OutVars{T=v_T_3} AuxVars[] AssignedVars[]" "[60] L66-->L67: Formula: (< 0 v_S_3) InVars {S=v_S_3} OutVars{S=v_S_3} AuxVars[] AssignedVars[]" "[67] L67-->L68: Formula: (< 0 v_U_3) InVars {U=v_U_3} OutVars{U=v_U_3} AuxVars[] AssignedVars[]" "[74] L68-->L69: Formula: (= v_T_1 v_t_9) InVars {t=v_t_9, T=v_T_1} OutVars{t=v_t_9, T=v_T_1} AuxVars[] AssignedVars[]" "[66] L69-->L70: Formula: (= v_S_1 v_s_9) InVars {s=v_s_9, S=v_S_1} OutVars{s=v_s_9, S=v_S_1} AuxVars[] AssignedVars[]" "[85] L70-->L71: Formula: (= v_U_1 v_u_5) InVars {u=v_u_5, U=v_U_1} OutVars{u=v_u_5, U=v_U_1} AuxVars[] AssignedVars[]" "[106] L71-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[109] L71-1-->L39-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:47,356 INFO L754 eck$LassoCheckResult]: Loop: "[95] L39-1-->L39: Formula: (or (< 0 v_t_3) (< 0 v_u_3)) InVars {u=v_u_3, t=v_t_3} OutVars{u=v_u_3, t=v_t_3} AuxVars[] AssignedVars[]" "[97] L39-->L39-1: Formula: (<= v_t_7 0) InVars {t=v_t_7} OutVars{t=v_t_7} AuxVars[] AssignedVars[]" [2025-04-26 18:41:47,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1260793903, now seen corresponding path program 1 times [2025-04-26 18:41:47,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492678106] [2025-04-26 18:41:47,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:47,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:47,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:47,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,368 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:47,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:47,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:47,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:47,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,373 INFO L85 PathProgramCache]: Analyzing trace with hash 4003, now seen corresponding path program 1 times [2025-04-26 18:41:47,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675088494] [2025-04-26 18:41:47,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:47,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:47,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:47,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,375 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:47,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:47,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:47,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:47,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,379 INFO L85 PathProgramCache]: Analyzing trace with hash 442166353, now seen corresponding path program 1 times [2025-04-26 18:41:47,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382173584] [2025-04-26 18:41:47,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:47,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:47,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:47,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:47,429 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:47,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:47,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382173584] [2025-04-26 18:41:47,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382173584] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:47,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:47,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:47,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441754850] [2025-04-26 18:41:47,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:47,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:47,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:41:47,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:41:47,447 INFO L87 Difference]: Start difference. First operand 157 states and 341 transitions. cyclomatic complexity: 216 Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:47,498 INFO L93 Difference]: Finished difference Result 199 states and 449 transitions. [2025-04-26 18:41:47,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 199 states and 449 transitions. [2025-04-26 18:41:47,500 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 131 [2025-04-26 18:41:47,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 199 states to 199 states and 449 transitions. [2025-04-26 18:41:47,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2025-04-26 18:41:47,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2025-04-26 18:41:47,506 INFO L74 IsDeterministic]: Start isDeterministic. Operand 199 states and 449 transitions. [2025-04-26 18:41:47,507 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:47,507 INFO L218 hiAutomatonCegarLoop]: Abstraction has 199 states and 449 transitions. [2025-04-26 18:41:47,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 449 transitions. [2025-04-26 18:41:47,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-04-26 18:41:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 199 states have (on average 2.2562814070351758) internal successors, (in total 449), 198 states have internal predecessors, (449), 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:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 449 transitions. [2025-04-26 18:41:47,516 INFO L240 hiAutomatonCegarLoop]: Abstraction has 199 states and 449 transitions. [2025-04-26 18:41:47,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:41:47,517 INFO L438 stractBuchiCegarLoop]: Abstraction has 199 states and 449 transitions. [2025-04-26 18:41:47,517 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:47,517 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 449 transitions. [2025-04-26 18:41:47,519 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 131 [2025-04-26 18:41:47,519 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:47,519 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:47,519 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:47,519 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:47,519 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L65: Formula: (= v_m_4 0) InVars {m=v_m_4} OutVars{m=v_m_4} AuxVars[] AssignedVars[]" "[87] L65-->L66: Formula: (< 0 v_T_3) InVars {T=v_T_3} OutVars{T=v_T_3} AuxVars[] AssignedVars[]" "[60] L66-->L67: Formula: (< 0 v_S_3) InVars {S=v_S_3} OutVars{S=v_S_3} AuxVars[] AssignedVars[]" "[67] L67-->L68: Formula: (< 0 v_U_3) InVars {U=v_U_3} OutVars{U=v_U_3} AuxVars[] AssignedVars[]" "[74] L68-->L69: Formula: (= v_T_1 v_t_9) InVars {t=v_t_9, T=v_T_1} OutVars{t=v_t_9, T=v_T_1} AuxVars[] AssignedVars[]" "[66] L69-->L70: Formula: (= v_S_1 v_s_9) InVars {s=v_s_9, S=v_S_1} OutVars{s=v_s_9, S=v_S_1} AuxVars[] AssignedVars[]" "[85] L70-->L71: Formula: (= v_U_1 v_u_5) InVars {u=v_u_5, U=v_U_1} OutVars{u=v_u_5, U=v_U_1} AuxVars[] AssignedVars[]" "[106] L71-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[90] L22-1-->L22: Formula: (or (< 0 v_s_1) (< 0 v_u_1) (< 0 v_t_1)) InVars {u=v_u_1, t=v_t_1, s=v_s_1} OutVars{u=v_u_1, t=v_t_1, s=v_s_1} AuxVars[] AssignedVars[]" "[93] L22-->L22-1: Formula: (and (< 0 v_s_15) (= v_s_15 (+ v_s_14 1)) (= (+ v_m_10 1) v_m_9)) InVars {m=v_m_10, s=v_s_15} OutVars{m=v_m_9, s=v_s_14} AuxVars[] AssignedVars[m, s]" [2025-04-26 18:41:47,520 INFO L754 eck$LassoCheckResult]: Loop: "[90] L22-1-->L22: Formula: (or (< 0 v_s_1) (< 0 v_u_1) (< 0 v_t_1)) InVars {u=v_u_1, t=v_t_1, s=v_s_1} OutVars{u=v_u_1, t=v_t_1, s=v_s_1} AuxVars[] AssignedVars[]" "[92] L22-->L22-1: Formula: (<= v_s_5 0) InVars {s=v_s_5} OutVars{s=v_s_5} AuxVars[] AssignedVars[]" [2025-04-26 18:41:47,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,520 INFO L85 PathProgramCache]: Analyzing trace with hash 429904833, now seen corresponding path program 1 times [2025-04-26 18:41:47,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102108659] [2025-04-26 18:41:47,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:47,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:47,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:47,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,530 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:47,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:47,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:47,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:47,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,535 INFO L85 PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 2 times [2025-04-26 18:41:47,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122315846] [2025-04-26 18:41:47,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:47,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:47,538 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:47,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:47,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:47,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:47,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:47,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:47,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash 821686979, now seen corresponding path program 1 times [2025-04-26 18:41:47,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190954297] [2025-04-26 18:41:47,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:47,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:47,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:47,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:47,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:47,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:47,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:47,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:47,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:47,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,691 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:47,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:47,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:47,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,714 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:47,723 INFO L201 PluginConnector]: Adding new model threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:47 BoogieIcfgContainer [2025-04-26 18:41:47,724 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:47,724 INFO L158 Benchmark]: Toolchain (without parser) took 1538.25ms. Allocated memory was 167.8MB in the beginning and 125.8MB in the end (delta: -41.9MB). Free memory was 94.2MB in the beginning and 56.8MB in the end (delta: 37.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:47,724 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:47,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.24ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 92.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:47,725 INFO L158 Benchmark]: Boogie Preprocessor took 30.16ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 91.3MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:47,725 INFO L158 Benchmark]: RCFGBuilder took 237.91ms. Allocated memory is still 167.8MB. Free memory was 91.2MB in the beginning and 80.0MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:47,725 INFO L158 Benchmark]: BuchiAutomizer took 1230.36ms. Allocated memory was 167.8MB in the beginning and 125.8MB in the end (delta: -41.9MB). Free memory was 79.8MB in the beginning and 56.8MB in the end (delta: 23.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:47,726 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.24ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 92.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.16ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 91.3MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 237.91ms. Allocated memory is still 167.8MB. Free memory was 91.2MB in the beginning and 80.0MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1230.36ms. Allocated memory was 167.8MB in the beginning and 125.8MB in the end (delta: -41.9MB). Free memory was 79.8MB in the beginning and 56.8MB in the end (delta: 23.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 35 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 253, Number of transitions in reduction automaton: 269, Number of states in reduction automaton: 130, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 199 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 21]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L64] 0 assume m == 0; VAL [m=0] [L65] 0 assume 0 < T; VAL [T=1, m=0] [L66] 0 assume 0 < S; VAL [S=1, T=1, m=0] [L67] 0 assume 0 < U; VAL [S=1, T=1, U=1, m=0] [L68] 0 assume t == T; VAL [S=1, T=1, U=1, m=0, t=1] [L69] 0 assume s == S; VAL [S=1, T=1, U=1, m=0, s=1, t=1] [L70] 0 assume u == U; VAL [S=1, T=1, U=1, m=0, s=1, t=1, u=1] [L71] FORK 0 fork 1 thread1(); VAL [S=1, T=1, U=1, m=0, s=1, t=1, u=1] [L21] COND TRUE 1 0 < s || 0 < t || 0 < u VAL [S=1, T=1, U=1, m=0, s=1, t=1, u=1] [L24] 1 assume 0 < s; [L25] 1 s := s - 1; [L26] 1 m := m + 1; VAL [S=1, T=1, U=1, m=1, s=0, t=1, u=1] Loop: [L21] COND TRUE 0 < s || 0 < t || 0 < u [L30] assume !(0 < s); End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L64] 0 assume m == 0; VAL [m=0] [L65] 0 assume 0 < T; VAL [T=1, m=0] [L66] 0 assume 0 < S; VAL [S=1, T=1, m=0] [L67] 0 assume 0 < U; VAL [S=1, T=1, U=1, m=0] [L68] 0 assume t == T; VAL [S=1, T=1, U=1, m=0, t=1] [L69] 0 assume s == S; VAL [S=1, T=1, U=1, m=0, s=1, t=1] [L70] 0 assume u == U; VAL [S=1, T=1, U=1, m=0, s=1, t=1, u=1] [L71] FORK 0 fork 1 thread1(); VAL [S=1, T=1, U=1, m=0, s=1, t=1, u=1] [L21] COND TRUE 1 0 < s || 0 < t || 0 < u VAL [S=1, T=1, U=1, m=0, s=1, t=1, u=1] [L24] 1 assume 0 < s; [L25] 1 s := s - 1; [L26] 1 m := m + 1; VAL [S=1, T=1, U=1, m=1, s=0, t=1, u=1] Loop: [L21] COND TRUE 0 < s || 0 < t || 0 < u [L30] assume !(0 < s); End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:41:47,738 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...