/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/termination/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:38:47,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:38:47,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:38:47,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:38:47,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:38:47,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:38:47,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:38:47,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:38:47,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:38:47,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:38:47,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:38:47,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:38:47,278 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:38:47,278 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:38:47,278 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:38:47,278 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:38:47,278 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:38:47,279 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:38:47,279 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:38:47,279 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:38:47,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:38:47,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:38:47,279 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:38:47,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:38:47,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:38:47,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:38:47,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:38:47,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:38:47,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:38:47,280 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:38:47,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:38:47,280 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:38:47,280 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:38:47,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:38:47,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:38:47,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:47,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:38:47,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:38:47,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:38:47,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:38:47,281 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:38:47,281 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:38:47,282 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:38:47,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:38:47,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:38:47,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:38:47,546 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:38:47,546 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:38:47,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl [2025-04-26 18:38:47,549 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl' [2025-04-26 18:38:47,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:38:47,564 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:38:47,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:47,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:38:47,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:38:47,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,599 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:38:47,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:47,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:38:47,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:38:47,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:38:47,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:38:47,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:38:47,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:38:47,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:38:47,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:47,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:47,655 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:38:47,657 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:38:47,674 INFO L124 BoogieDeclarations]: Specification and implementation of procedure one given in one single declaration [2025-04-26 18:38:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure one [2025-04-26 18:38:47,674 INFO L138 BoogieDeclarations]: Found implementation of procedure one [2025-04-26 18:38:47,674 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:38:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:38:47,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:38:47,674 INFO L124 BoogieDeclarations]: Specification and implementation of procedure three given in one single declaration [2025-04-26 18:38:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure three [2025-04-26 18:38:47,674 INFO L138 BoogieDeclarations]: Found implementation of procedure three [2025-04-26 18:38:47,675 INFO L124 BoogieDeclarations]: Specification and implementation of procedure two given in one single declaration [2025-04-26 18:38:47,675 INFO L130 BoogieDeclarations]: Found specification of procedure two [2025-04-26 18:38:47,675 INFO L138 BoogieDeclarations]: Found implementation of procedure two [2025-04-26 18:38:47,675 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:38:47,705 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:38:47,706 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:38:47,753 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:38:47,754 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:38:47,760 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:38:47,761 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:38:47,761 INFO L201 PluginConnector]: Adding new model Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:47 BoogieIcfgContainer [2025-04-26 18:38:47,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:38:47,761 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:38:47,762 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:38:47,766 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:38:47,767 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:47,767 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/2) ... [2025-04-26 18:38:47,768 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7866b4f and model type Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:38:47, skipping insertion in model container [2025-04-26 18:38:47,768 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:47,768 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:47" (2/2) ... [2025-04-26 18:38:47,769 INFO L376 chiAutomizerObserver]: Analyzing ICFG Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl [2025-04-26 18:38:47,807 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2025-04-26 18:38:47,842 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:47,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:47,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:47,844 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:38:47,846 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:38:47,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 34 transitions, 107 flow [2025-04-26 18:38:47,915 INFO L116 PetriNetUnfolderBase]: 8/31 cut-off events. [2025-04-26 18:38:47,917 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-26 18:38:47,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 31 events. 8/31 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 27. Up to 6 conditions per place. [2025-04-26 18:38:47,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 34 transitions, 107 flow [2025-04-26 18:38:47,926 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 28 transitions, 92 flow [2025-04-26 18:38:47,926 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 28 transitions, 92 flow [2025-04-26 18:38:47,926 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 28 transitions, 92 flow [2025-04-26 18:38:47,963 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 179 states, 178 states have (on average 2.943820224719101) internal successors, (in total 524), 178 states have internal predecessors, (524), 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:38:47,964 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 179 states, 178 states have (on average 2.943820224719101) internal successors, (in total 524), 178 states have internal predecessors, (524), 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:38:47,965 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:48,100 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159#[L29, L22, L11, L38]true [2025-04-26 18:38:48,101 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 113#[L21, L37, L30, L11]true [2025-04-26 18:38:48,107 WARN L140 AmpleReduction]: Number of pruned transitions: 150 [2025-04-26 18:38:48,107 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 2 [2025-04-26 18:38:48,107 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 33 [2025-04-26 18:38:48,107 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:40 [2025-04-26 18:38:48,108 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:87 [2025-04-26 18:38:48,108 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 18:38:48,108 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:12 [2025-04-26 18:38:48,108 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:48,108 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 159 states, 158 states have (on average 1.9367088607594938) internal successors, (in total 306), 158 states have internal predecessors, (306), 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:38:48,116 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:48,117 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:48,117 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:48,117 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:48,117 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:48,117 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:48,117 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:48,117 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:48,119 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 159 states, 158 states have (on average 1.9367088607594938) internal successors, (in total 306), 158 states have internal predecessors, (306), 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:38:48,137 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 103 [2025-04-26 18:38:48,139 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:48,139 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:48,143 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:38:48,143 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:38:48,143 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:48,143 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 159 states, 158 states have (on average 1.9367088607594938) internal successors, (in total 306), 158 states have internal predecessors, (306), 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:38:48,148 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 103 [2025-04-26 18:38:48,148 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:48,149 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:48,149 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:38:48,149 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:38:48,153 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" [2025-04-26 18:38:48,153 INFO L754 eck$LassoCheckResult]: Loop: "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" [2025-04-26 18:38:48,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:48,156 INFO L85 PathProgramCache]: Analyzing trace with hash 75212, now seen corresponding path program 1 times [2025-04-26 18:38:48,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:48,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714417] [2025-04-26 18:38:48,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:48,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:48,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:48,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:48,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:48,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:48,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:48,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:48,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:48,225 INFO L85 PathProgramCache]: Analyzing trace with hash 83478, now seen corresponding path program 1 times [2025-04-26 18:38:48,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:48,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933869386] [2025-04-26 18:38:48,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:48,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:48,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:48,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:48,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,231 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:48,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:48,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:48,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:48,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2054272917, now seen corresponding path program 1 times [2025-04-26 18:38:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:48,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573764692] [2025-04-26 18:38:48,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:48,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:48,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:48,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:48,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,250 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:48,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:48,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:48,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:48,312 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:48,313 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:48,313 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:48,313 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:48,313 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:48,313 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,313 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:48,313 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:48,313 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 18:38:48,313 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:48,314 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:48,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:48,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:48,430 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:48,430 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:48,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:48,435 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:38:48,437 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:38:48,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:48,439 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:48,458 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:38:48,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:48,460 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:38:48,462 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:38:48,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:48,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:48,491 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:48,496 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:38:48,496 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:48,497 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:48,497 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:48,497 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:48,497 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:48,497 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,497 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:48,497 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:48,498 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 18:38:48,498 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:48,498 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:48,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:48,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:48,547 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:48,550 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:48,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:48,555 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:38:48,558 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:38:48,560 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:38:48,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:48,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:48,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:48,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:48,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:48,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:48,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:48,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:48,583 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:38:48,583 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:38:48,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:48,587 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:38:48,589 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:38:48,590 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:48,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:48,594 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:48,594 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:48,594 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = -2*n + 7 Supporting invariants [] [2025-04-26 18:38:48,600 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:38:48,602 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:48,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:48,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:48,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:48,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:48,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:48,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:48,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:48,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:48,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:48,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:48,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:48,697 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:38:48,718 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:38:48,720 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 159 states, 158 states have (on average 1.9367088607594938) internal successors, (in total 306), 158 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:38:48,842 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 159 states, 158 states have (on average 1.9367088607594938) internal successors, (in total 306), 158 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 545 states and 1123 transitions. Complement of second has 7 states. [2025-04-26 18:38:48,844 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:38:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:38:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-26 18:38:48,850 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:38:48,851 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:48,851 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:38:48,851 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:48,851 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:38:48,851 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:48,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 545 states and 1123 transitions. [2025-04-26 18:38:48,868 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 149 [2025-04-26 18:38:48,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 545 states to 355 states and 772 transitions. [2025-04-26 18:38:48,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2025-04-26 18:38:48,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 280 [2025-04-26 18:38:48,880 INFO L74 IsDeterministic]: Start isDeterministic. Operand 355 states and 772 transitions. [2025-04-26 18:38:48,880 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:48,880 INFO L218 hiAutomatonCegarLoop]: Abstraction has 355 states and 772 transitions. [2025-04-26 18:38:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states and 772 transitions. [2025-04-26 18:38:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 241. [2025-04-26 18:38:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 241 states have (on average 2.1493775933609958) internal successors, (in total 518), 240 states have internal predecessors, (518), 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:38:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 518 transitions. [2025-04-26 18:38:48,913 INFO L240 hiAutomatonCegarLoop]: Abstraction has 241 states and 518 transitions. [2025-04-26 18:38:48,913 INFO L438 stractBuchiCegarLoop]: Abstraction has 241 states and 518 transitions. [2025-04-26 18:38:48,913 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:38:48,914 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 518 transitions. [2025-04-26 18:38:48,919 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 111 [2025-04-26 18:38:48,919 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:48,919 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:48,919 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:38:48,919 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:48,920 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" [2025-04-26 18:38:48,920 INFO L754 eck$LassoCheckResult]: Loop: "[59] L29-->L30: Formula: (= 2 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[61] L30-->L29: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:48,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:48,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2331643, now seen corresponding path program 1 times [2025-04-26 18:38:48,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:48,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457041515] [2025-04-26 18:38:48,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:48,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:48,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:48,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:48,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:48,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:48,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:48,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:48,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2025-04-26 18:38:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:48,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127316491] [2025-04-26 18:38:48,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:48,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:48,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:48,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,931 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:48,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:48,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:48,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:48,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:48,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2054256483, now seen corresponding path program 1 times [2025-04-26 18:38:48,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:48,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920984177] [2025-04-26 18:38:48,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:48,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:48,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:48,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:48,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:48,968 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:38:48,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:48,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920984177] [2025-04-26 18:38:48,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920984177] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:48,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:48,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:38:48,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157851307] [2025-04-26 18:38:48,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:48,985 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:48,985 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:48,985 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:48,985 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:48,985 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:48,985 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,985 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:48,985 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:48,985 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 18:38:48,986 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:48,986 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:48,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:49,001 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:49,001 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:49,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,004 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:38:49,005 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:38:49,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:49,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:49,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:38:49,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,024 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:38:49,024 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:38:49,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:49,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:49,037 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:49,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:38:49,044 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:49,044 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:49,044 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:49,044 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:49,044 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:49,044 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,044 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:49,044 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:49,044 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 18:38:49,044 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:49,044 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:49,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:49,066 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:49,067 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:49,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,069 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:38:49,071 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:38:49,072 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:38:49,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:49,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:49,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:49,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:49,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:49,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:49,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:49,088 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:49,090 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:38:49,090 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:38:49,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,092 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:38:49,094 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:38:49,095 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:49,098 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:38:49,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:49,101 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:49,102 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:49,102 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2025-04-26 18:38:49,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:49,112 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:49,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:49,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:49,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:49,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,139 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,156 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:38:49,157 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:38:49,157 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 241 states and 518 transitions. cyclomatic complexity: 326 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:38:49,231 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 241 states and 518 transitions. cyclomatic complexity: 326. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 880 states and 1979 transitions. Complement of second has 7 states. [2025-04-26 18:38:49,232 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:38:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:38:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-26 18:38:49,233 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:38:49,233 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,233 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:38:49,233 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,233 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:38:49,233 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 880 states and 1979 transitions. [2025-04-26 18:38:49,239 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 141 [2025-04-26 18:38:49,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 880 states to 655 states and 1510 transitions. [2025-04-26 18:38:49,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2025-04-26 18:38:49,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 403 [2025-04-26 18:38:49,245 INFO L74 IsDeterministic]: Start isDeterministic. Operand 655 states and 1510 transitions. [2025-04-26 18:38:49,245 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:49,245 INFO L218 hiAutomatonCegarLoop]: Abstraction has 655 states and 1510 transitions. [2025-04-26 18:38:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states and 1510 transitions. [2025-04-26 18:38:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 458. [2025-04-26 18:38:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 458 states have (on average 2.534934497816594) internal successors, (in total 1161), 457 states have internal predecessors, (1161), 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:38:49,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1161 transitions. [2025-04-26 18:38:49,272 INFO L240 hiAutomatonCegarLoop]: Abstraction has 458 states and 1161 transitions. [2025-04-26 18:38:49,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:49,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:38:49,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:38:49,274 INFO L87 Difference]: Start difference. First operand 458 states and 1161 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 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:38:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:49,310 INFO L93 Difference]: Finished difference Result 604 states and 1366 transitions. [2025-04-26 18:38:49,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 604 states and 1366 transitions. [2025-04-26 18:38:49,314 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 96 [2025-04-26 18:38:49,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 604 states to 464 states and 1067 transitions. [2025-04-26 18:38:49,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2025-04-26 18:38:49,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 327 [2025-04-26 18:38:49,318 INFO L74 IsDeterministic]: Start isDeterministic. Operand 464 states and 1067 transitions. [2025-04-26 18:38:49,318 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:49,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 464 states and 1067 transitions. [2025-04-26 18:38:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states and 1067 transitions. [2025-04-26 18:38:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 301. [2025-04-26 18:38:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 301 states have (on average 2.4385382059800667) internal successors, (in total 734), 300 states have internal predecessors, (734), 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:38:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 734 transitions. [2025-04-26 18:38:49,324 INFO L240 hiAutomatonCegarLoop]: Abstraction has 301 states and 734 transitions. [2025-04-26 18:38:49,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:38:49,325 INFO L438 stractBuchiCegarLoop]: Abstraction has 301 states and 734 transitions. [2025-04-26 18:38:49,325 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:38:49,325 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states and 734 transitions. [2025-04-26 18:38:49,326 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 70 [2025-04-26 18:38:49,326 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:49,326 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:49,327 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:49,327 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:49,327 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" "[53] L20-->oneFINAL: Formula: (or (<= 4 v_n_4) (not (= v_x_3 1))) InVars {x=v_x_3, n=v_n_4} OutVars{x=v_x_3, n=v_n_4} AuxVars[] AssignedVars[]" "[58] L29-->twoFINAL: Formula: (not (= 2 v_x_7)) InVars {x=v_x_7} OutVars{x=v_x_7} AuxVars[] AssignedVars[]" [2025-04-26 18:38:49,327 INFO L754 eck$LassoCheckResult]: Loop: "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 18:38:49,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,327 INFO L85 PathProgramCache]: Analyzing trace with hash 742572692, now seen corresponding path program 1 times [2025-04-26 18:38:49,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:49,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421956199] [2025-04-26 18:38:49,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:49,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:49,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:49,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:49,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,378 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:38:49,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:49,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421956199] [2025-04-26 18:38:49,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421956199] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:49,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:49,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:38:49,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920965045] [2025-04-26 18:38:49,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:49,379 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:49,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 1 times [2025-04-26 18:38:49,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:49,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745084948] [2025-04-26 18:38:49,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:49,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:49,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:49,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:49,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:49,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:49,393 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:49,393 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:49,393 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:49,393 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:49,393 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:49,393 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,393 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:49,393 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:49,393 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 18:38:49,393 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:49,394 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:49,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:49,409 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:49,409 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:49,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,411 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:38:49,412 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:38:49,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:49,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:49,435 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:38:49,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,437 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:38:49,437 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:38:49,438 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:49,438 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:49,450 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:49,456 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:38:49,456 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:49,456 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:49,456 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:49,456 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:49,456 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:49,456 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,456 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:49,456 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:49,456 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 18:38:49,456 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:49,456 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:49,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:49,474 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:49,474 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:49,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,476 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:38:49,478 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:38:49,479 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:38:49,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:49,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:49,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:49,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:49,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:49,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:49,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:49,492 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:49,495 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:38:49,495 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:38:49,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,497 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:38:49,498 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:38:49,499 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:49,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:38:49,502 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:49,503 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:49,503 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = 1*n Supporting invariants [] [2025-04-26 18:38:49,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:49,509 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:49,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:49,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:49,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:49,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,537 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,544 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:38:49,544 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:38:49,545 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 301 states and 734 transitions. cyclomatic complexity: 465 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:38:49,601 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 301 states and 734 transitions. cyclomatic complexity: 465. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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 514 states and 1076 transitions. Complement of second has 9 states. [2025-04-26 18:38:49,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 18:38:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:38:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-04-26 18:38:49,602 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:38:49,602 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,602 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:38:49,602 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,602 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:38:49,602 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 514 states and 1076 transitions. [2025-04-26 18:38:49,605 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 73 [2025-04-26 18:38:49,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 514 states to 394 states and 865 transitions. [2025-04-26 18:38:49,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2025-04-26 18:38:49,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2025-04-26 18:38:49,608 INFO L74 IsDeterministic]: Start isDeterministic. Operand 394 states and 865 transitions. [2025-04-26 18:38:49,608 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:49,608 INFO L218 hiAutomatonCegarLoop]: Abstraction has 394 states and 865 transitions. [2025-04-26 18:38:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states and 865 transitions. [2025-04-26 18:38:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 344. [2025-04-26 18:38:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 344 states have (on average 2.2994186046511627) internal successors, (in total 791), 343 states have internal predecessors, (791), 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:38:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 791 transitions. [2025-04-26 18:38:49,616 INFO L240 hiAutomatonCegarLoop]: Abstraction has 344 states and 791 transitions. [2025-04-26 18:38:49,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:49,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:38:49,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:38:49,616 INFO L87 Difference]: Start difference. First operand 344 states and 791 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:49,674 INFO L93 Difference]: Finished difference Result 498 states and 1026 transitions. [2025-04-26 18:38:49,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 1026 transitions. [2025-04-26 18:38:49,677 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 75 [2025-04-26 18:38:49,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 455 states and 919 transitions. [2025-04-26 18:38:49,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2025-04-26 18:38:49,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2025-04-26 18:38:49,682 INFO L74 IsDeterministic]: Start isDeterministic. Operand 455 states and 919 transitions. [2025-04-26 18:38:49,682 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:49,682 INFO L218 hiAutomatonCegarLoop]: Abstraction has 455 states and 919 transitions. [2025-04-26 18:38:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states and 919 transitions. [2025-04-26 18:38:49,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 390. [2025-04-26 18:38:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 390 states have (on average 2.117948717948718) internal successors, (in total 826), 389 states have internal predecessors, (826), 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:38:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 826 transitions. [2025-04-26 18:38:49,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 390 states and 826 transitions. [2025-04-26 18:38:49,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:38:49,691 INFO L438 stractBuchiCegarLoop]: Abstraction has 390 states and 826 transitions. [2025-04-26 18:38:49,691 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:38:49,691 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 390 states and 826 transitions. [2025-04-26 18:38:49,692 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 74 [2025-04-26 18:38:49,692 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:49,692 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:49,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:49,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:49,693 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" "[59] L29-->L30: Formula: (= 2 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" [2025-04-26 18:38:49,693 INFO L754 eck$LassoCheckResult]: Loop: "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 18:38:49,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,694 INFO L85 PathProgramCache]: Analyzing trace with hash 145004561, now seen corresponding path program 1 times [2025-04-26 18:38:49,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:49,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717804543] [2025-04-26 18:38:49,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:49,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:49,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:49,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:49,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,701 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:49,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:49,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:49,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:49,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 2 times [2025-04-26 18:38:49,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:49,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002107432] [2025-04-26 18:38:49,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:49,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:49,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:49,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:38:49,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:49,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:49,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:49,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1910431667, now seen corresponding path program 1 times [2025-04-26 18:38:49,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:49,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424928300] [2025-04-26 18:38:49,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:49,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:49,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:38:49,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:38:49,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,757 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:38:49,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:49,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424928300] [2025-04-26 18:38:49,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424928300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:49,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:49,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:38:49,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312481910] [2025-04-26 18:38:49,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:49,766 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:49,766 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:49,766 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:49,766 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:49,766 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:49,766 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,766 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:49,766 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:49,766 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration4_Loop [2025-04-26 18:38:49,766 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:49,766 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:49,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:49,784 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:49,784 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:49,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,787 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:38:49,798 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:38:49,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:49,799 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:49,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:49,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,824 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:38:49,825 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:38:49,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:49,827 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:49,839 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:49,845 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:38:49,845 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:49,846 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:49,846 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:49,846 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:49,846 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:49,846 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,846 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:49,846 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:49,846 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration4_Loop [2025-04-26 18:38:49,846 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:49,846 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:49,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:49,863 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:49,863 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:49,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,865 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:38:49,865 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:38:49,867 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:38:49,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:49,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:49,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:49,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:49,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:49,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:49,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:49,880 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:49,882 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:38:49,882 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:38:49,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,884 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:38:49,886 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:38:49,887 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:49,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:49,890 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:49,891 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:49,891 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = 1*n Supporting invariants [] [2025-04-26 18:38:49,896 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:38:49,897 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:49,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:49,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:49,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:49,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,932 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,939 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:38:49,939 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:38:49,939 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 390 states and 826 transitions. cyclomatic complexity: 471 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:49,998 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 390 states and 826 transitions. cyclomatic complexity: 471. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1394 states and 2706 transitions. Complement of second has 9 states. [2025-04-26 18:38:49,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 18:38:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-04-26 18:38:49,999 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:38:50,000 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:50,000 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:38:50,001 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:50,001 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:38:50,001 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:50,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1394 states and 2706 transitions. [2025-04-26 18:38:50,013 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 139 [2025-04-26 18:38:50,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1394 states to 1052 states and 2100 transitions. [2025-04-26 18:38:50,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 465 [2025-04-26 18:38:50,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 527 [2025-04-26 18:38:50,021 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1052 states and 2100 transitions. [2025-04-26 18:38:50,021 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:50,021 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1052 states and 2100 transitions. [2025-04-26 18:38:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states and 2100 transitions. [2025-04-26 18:38:50,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 584. [2025-04-26 18:38:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 584 states have (on average 2.2551369863013697) internal successors, (in total 1317), 583 states have internal predecessors, (1317), 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:38:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1317 transitions. [2025-04-26 18:38:50,039 INFO L240 hiAutomatonCegarLoop]: Abstraction has 584 states and 1317 transitions. [2025-04-26 18:38:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:50,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:38:50,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:38:50,039 INFO L87 Difference]: Start difference. First operand 584 states and 1317 transitions. Second operand has 4 states, 4 states have (on average 2.75) 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:38:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:50,080 INFO L93 Difference]: Finished difference Result 1034 states and 2028 transitions. [2025-04-26 18:38:50,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1034 states and 2028 transitions. [2025-04-26 18:38:50,086 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 88 [2025-04-26 18:38:50,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1034 states to 768 states and 1554 transitions. [2025-04-26 18:38:50,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 343 [2025-04-26 18:38:50,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 417 [2025-04-26 18:38:50,090 INFO L74 IsDeterministic]: Start isDeterministic. Operand 768 states and 1554 transitions. [2025-04-26 18:38:50,090 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:50,090 INFO L218 hiAutomatonCegarLoop]: Abstraction has 768 states and 1554 transitions. [2025-04-26 18:38:50,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states and 1554 transitions. [2025-04-26 18:38:50,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 431. [2025-04-26 18:38:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 431 states have (on average 2.19953596287703) internal successors, (in total 948), 430 states have internal predecessors, (948), 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:38:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 948 transitions. [2025-04-26 18:38:50,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 431 states and 948 transitions. [2025-04-26 18:38:50,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:38:50,100 INFO L438 stractBuchiCegarLoop]: Abstraction has 431 states and 948 transitions. [2025-04-26 18:38:50,100 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:38:50,100 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 431 states and 948 transitions. [2025-04-26 18:38:50,102 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 87 [2025-04-26 18:38:50,102 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:50,102 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:50,102 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:50,102 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2025-04-26 18:38:50,103 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 18:38:50,103 INFO L754 eck$LassoCheckResult]: Loop: "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 18:38:50,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash -316089485, now seen corresponding path program 1 times [2025-04-26 18:38:50,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309626336] [2025-04-26 18:38:50,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:38:50,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:38:50,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:50,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:50,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309626336] [2025-04-26 18:38:50,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309626336] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:50,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:50,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:38:50,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504896931] [2025-04-26 18:38:50,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:50,134 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:50,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1954045827, now seen corresponding path program 1 times [2025-04-26 18:38:50,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103196793] [2025-04-26 18:38:50,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:50,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:50,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:50,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:50,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:50,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103196793] [2025-04-26 18:38:50,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103196793] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:50,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:50,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:38:50,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412111334] [2025-04-26 18:38:50,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:50,154 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 18:38:50,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:50,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:38:50,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:38:50,155 INFO L87 Difference]: Start difference. First operand 431 states and 948 transitions. cyclomatic complexity: 540 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:38:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:50,173 INFO L93 Difference]: Finished difference Result 337 states and 557 transitions. [2025-04-26 18:38:50,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 557 transitions. [2025-04-26 18:38:50,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2025-04-26 18:38:50,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 123 states and 223 transitions. [2025-04-26 18:38:50,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-04-26 18:38:50,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 18:38:50,177 INFO L74 IsDeterministic]: Start isDeterministic. Operand 123 states and 223 transitions. [2025-04-26 18:38:50,177 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:50,177 INFO L218 hiAutomatonCegarLoop]: Abstraction has 123 states and 223 transitions. [2025-04-26 18:38:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 223 transitions. [2025-04-26 18:38:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2025-04-26 18:38:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.8135593220338984) internal successors, (in total 214), 117 states have internal predecessors, (214), 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:38:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 214 transitions. [2025-04-26 18:38:50,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 214 transitions. [2025-04-26 18:38:50,179 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:38:50,180 INFO L438 stractBuchiCegarLoop]: Abstraction has 118 states and 214 transitions. [2025-04-26 18:38:50,180 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:38:50,180 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 214 transitions. [2025-04-26 18:38:50,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2025-04-26 18:38:50,180 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:50,180 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:50,180 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:50,180 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1] [2025-04-26 18:38:50,181 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" "[59] L29-->L30: Formula: (= 2 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[61] L30-->L29: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 18:38:50,181 INFO L754 eck$LassoCheckResult]: Loop: "[59] L29-->L30: Formula: (= 2 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[61] L30-->L29: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[59] L29-->L30: Formula: (= 2 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[61] L30-->L29: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 18:38:50,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash 140526987, now seen corresponding path program 1 times [2025-04-26 18:38:50,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699982894] [2025-04-26 18:38:50,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:50,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:38:50,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:38:50,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:50,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:38:50,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:38:50,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:50,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,196 INFO L85 PathProgramCache]: Analyzing trace with hash -490312829, now seen corresponding path program 1 times [2025-04-26 18:38:50,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434297941] [2025-04-26 18:38:50,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:50,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:38:50,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:38:50,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:50,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:38:50,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:38:50,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:50,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1049145869, now seen corresponding path program 2 times [2025-04-26 18:38:50,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079133629] [2025-04-26 18:38:50,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:50,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-26 18:38:50,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:38:50,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:38:50,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,223 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:50,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 18:38:50,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:38:50,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:50,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:38:50,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:38:50,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,377 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:50,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:38:50,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:38:50,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:50,404 INFO L201 PluginConnector]: Adding new model Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:38:50 BoogieIcfgContainer [2025-04-26 18:38:50,404 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:38:50,404 INFO L158 Benchmark]: Toolchain (without parser) took 2840.37ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 86.4MB in the beginning and 58.1MB in the end (delta: 28.3MB). Peak memory consumption was 39.2MB. Max. memory is 8.0GB. [2025-04-26 18:38:50,405 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.76ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:50,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:50,405 INFO L158 Benchmark]: Boogie Preprocessor took 25.49ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.5MB in the end (delta: 901.0kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:38:50,405 INFO L158 Benchmark]: RCFGBuilder took 131.14ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 74.0MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:38:50,405 INFO L158 Benchmark]: BuchiAutomizer took 2642.33ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 74.0MB in the beginning and 58.1MB in the end (delta: 15.9MB). Peak memory consumption was 26.6MB. Max. memory is 8.0GB. [2025-04-26 18:38:50,406 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.76ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.49ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.5MB in the end (delta: 901.0kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 131.14ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 74.0MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2642.33ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 74.0MB in the beginning and 58.1MB in the end (delta: 15.9MB). Peak memory consumption was 26.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 8. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 1399 StatesRemovedByMinimization, 8 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 278 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 365 IncrementalHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 152 mSDtfsCounter, 365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI1 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf89 smp100 dnf100 smp100 tf114 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 43ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 269, Number of transitions in reduction automaton: 306, Number of states in reduction automaton: 159, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 7 + -2 * n and consists of 4 locations. One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function n and consists of 5 locations. One deterministic module has affine ranking function n and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 118 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 29]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; VAL [x=1] [L7] 0 n := 1; VAL [n=1, x=1] [L9] FORK 0 fork 1 one(); VAL [n=1, x=1] [L20] COND TRUE 1 x == 1 && n < 4 VAL [n=1, x=1] [L10] FORK 0 fork 2 two(); VAL [n=1, x=1] [L21] 1 x := 2; VAL [n=1, x=2] [L22] 1 n := n + 1; VAL [n=2, x=2] [L11] FORK 0 fork 3 three(); VAL [n=2, x=2] [L29] COND TRUE 2 x == 2 VAL [n=2, x=2] [L30] 2 x := 1; VAL [n=2, x=1] [L20] COND TRUE 1 x == 1 && n < 4 VAL [n=2, x=1] [L21] 1 x := 2; VAL [n=2, x=2] [L22] 1 n := n + 1; VAL [n=3, x=2] [L37] COND TRUE 3 n == 3 VAL [n=3, x=2] [L38] 3 n := 1; VAL [n=1, x=2] Loop: [L29] COND TRUE x == 2 [L30] x := 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L22] n := n + 1; [L29] COND TRUE x == 2 [L30] x := 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L22] n := n + 1; [L37] COND TRUE n == 3 [L38] n := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L7] 0 n := 1; VAL [n=1, x=1] [L9] FORK 0 fork 1 one(); VAL [n=1, x=1] [L20] COND TRUE 1 x == 1 && n < 4 VAL [n=1, x=1] [L10] FORK 0 fork 2 two(); VAL [n=1, x=1] [L21] 1 x := 2; VAL [n=1, x=2] [L22] 1 n := n + 1; VAL [n=2, x=2] [L11] FORK 0 fork 3 three(); VAL [n=2, x=2] [L29] COND TRUE 2 x == 2 VAL [n=2, x=2] [L30] 2 x := 1; VAL [n=2, x=1] [L20] COND TRUE 1 x == 1 && n < 4 VAL [n=2, x=1] [L21] 1 x := 2; VAL [n=2, x=2] [L22] 1 n := n + 1; VAL [n=3, x=2] [L37] COND TRUE 3 n == 3 VAL [n=3, x=2] [L38] 3 n := 1; VAL [n=1, x=2] Loop: [L29] COND TRUE x == 2 [L30] x := 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L22] n := n + 1; [L29] COND TRUE x == 2 [L30] x := 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L22] n := n + 1; [L37] COND TRUE n == 3 [L38] n := 1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:38:50,422 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...