/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/concurrent_FiveToOne_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:38:47,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:38:47,889 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,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:38:47,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:38:47,896 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,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:38:47,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:38:47,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:38:47,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:38:47,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:38:47,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:38:47,919 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:38:47,919 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:38:47,919 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:38:47,919 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:38:47,919 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:38:47,919 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:38:47,920 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:38:47,920 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:38:47,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:38:47,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:38:47,920 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:38:47,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:38:47,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:38:47,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:38:47,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:38:47,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:38:47,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:38:47,920 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:38:47,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:38:47,920 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:38:47,921 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:38:47,921 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:38:47,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:38:47,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:47,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:38:47,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:38:47,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:38:47,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:38:47,921 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:38:47,921 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:38:47,921 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:38:48,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:38:48,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:38:48,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:38:48,180 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:38:48,180 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:38:48,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_FiveToOne_nonterminating.bpl [2025-04-26 18:38:48,184 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_FiveToOne_nonterminating.bpl' [2025-04-26 18:38:48,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:38:48,198 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:38:48,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:48,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:38:48,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:38:48,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:48" (1/1) ... [2025-04-26 18:38:48,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:48" (1/1) ... [2025-04-26 18:38:48,227 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:38:48,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:48,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:38:48,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:38:48,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:38:48,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:48" (1/1) ... [2025-04-26 18:38:48,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:48" (1/1) ... [2025-04-26 18:38:48,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:48" (1/1) ... [2025-04-26 18:38:48,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:48" (1/1) ... [2025-04-26 18:38:48,235 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:48" (1/1) ... [2025-04-26 18:38:48,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:48" (1/1) ... [2025-04-26 18:38:48,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:48" (1/1) ... [2025-04-26 18:38:48,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:48" (1/1) ... [2025-04-26 18:38:48,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:48" (1/1) ... [2025-04-26 18:38:48,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:38:48,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:38:48,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:38:48,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:38:48,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:48" (1/1) ... [2025-04-26 18:38:48,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:48,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:48,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:48,280 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:48,301 INFO L124 BoogieDeclarations]: Specification and implementation of procedure once given in one single declaration [2025-04-26 18:38:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure once [2025-04-26 18:38:48,301 INFO L138 BoogieDeclarations]: Found implementation of procedure once [2025-04-26 18:38:48,301 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:38:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:38:48,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:38:48,301 INFO L124 BoogieDeclarations]: Specification and implementation of procedure five given in one single declaration [2025-04-26 18:38:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure five [2025-04-26 18:38:48,301 INFO L138 BoogieDeclarations]: Found implementation of procedure five [2025-04-26 18:38:48,302 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:48,332 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:38:48,333 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:38:48,380 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:38:48,380 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:38:48,387 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:38:48,388 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:38:48,388 INFO L201 PluginConnector]: Adding new model concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:48 BoogieIcfgContainer [2025-04-26 18:38:48,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:38:48,389 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:38:48,389 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:38:48,392 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:38:48,393 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:48,393 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:48" (1/2) ... [2025-04-26 18:38:48,394 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69cac677 and model type concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:38:48, skipping insertion in model container [2025-04-26 18:38:48,394 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:48,394 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:48" (2/2) ... [2025-04-26 18:38:48,395 INFO L376 chiAutomizerObserver]: Analyzing ICFG concurrent_FiveToOne_nonterminating.bpl [2025-04-26 18:38:48,423 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:38:48,459 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:48,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:48,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:48,462 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:48,467 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:48,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 20 transitions, 60 flow [2025-04-26 18:38:48,521 INFO L116 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-04-26 18:38:48,523 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:38:48,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 3/16 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2025-04-26 18:38:48,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 20 transitions, 60 flow [2025-04-26 18:38:48,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 16 transitions, 50 flow [2025-04-26 18:38:48,533 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 19 places, 16 transitions, 50 flow [2025-04-26 18:38:48,534 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 19 places, 16 transitions, 50 flow [2025-04-26 18:38:48,542 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 32 states, 31 states have (on average 1.967741935483871) internal successors, (in total 61), 31 states have internal predecessors, (61), 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,542 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 32 states, 31 states have (on average 1.967741935483871) internal successors, (in total 61), 31 states have internal predecessors, (61), 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,544 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:48,598 WARN L140 AmpleReduction]: Number of pruned transitions: 9 [2025-04-26 18:38:48,599 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:38:48,599 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 4 [2025-04-26 18:38:48,599 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:18 [2025-04-26 18:38:48,599 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:9 [2025-04-26 18:38:48,599 WARN L145 AmpleReduction]: Times succ was already a loop node:11 [2025-04-26 18:38:48,599 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:48,599 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:48,599 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 32 states, 31 states have (on average 1.6774193548387097) internal successors, (in total 52), 31 states have internal predecessors, (52), 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,604 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:48,605 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:48,605 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:48,605 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:48,605 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:48,605 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:48,605 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:48,605 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:48,606 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 31 states have (on average 1.6774193548387097) internal successors, (in total 52), 31 states have internal predecessors, (52), 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,614 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18 [2025-04-26 18:38:48,615 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:48,615 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:48,617 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:38:48,617 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:48,617 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:48,617 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 31 states have (on average 1.6774193548387097) internal successors, (in total 52), 31 states have internal predecessors, (52), 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,619 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18 [2025-04-26 18:38:48,619 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:48,619 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:48,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:38:48,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:48,623 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0]" [2025-04-26 18:38:48,623 INFO L754 eck$LassoCheckResult]: Loop: "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:48,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:48,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1966, now seen corresponding path program 1 times [2025-04-26 18:38:48,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:48,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057458692] [2025-04-26 18:38:48,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:48,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:48,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:48,681 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,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,682 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:48,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:48,686 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,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:48,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2211, now seen corresponding path program 1 times [2025-04-26 18:38:48,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:48,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184137945] [2025-04-26 18:38:48,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:48,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:48,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:48,712 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,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:48,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:48,714 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,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:48,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:48,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1890576, now seen corresponding path program 1 times [2025-04-26 18:38:48,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:48,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607094278] [2025-04-26 18:38:48,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:48,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:48,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:48,726 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,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,727 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:48,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:48,731 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,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:48,781 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:48,781 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:48,781 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:48,782 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:48,782 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:48,782 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,782 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:48,782 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:48,782 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 18:38:48,782 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:48,782 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:48,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:48,834 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:48,835 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:48,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:48,871 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,873 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,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:48,874 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:48,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:48,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:48,900 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,901 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,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:48,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:48,929 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:48,934 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,934 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:48,934 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:48,934 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:48,934 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:48,934 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:48,934 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,934 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:48,934 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:48,934 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 18:38:48,934 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:48,934 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:48,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:48,961 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:48,964 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:48,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:48,967 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,970 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,971 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,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:48,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:48,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:48,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:48,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:48,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:48,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:48,995 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:49,000 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:38:49,000 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:38:49,001 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 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:49,006 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:49,006 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:49,009 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:38:49,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:38:49,011 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:49,011 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:49,012 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 7 Supporting invariants [] [2025-04-26 18:38:49,018 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:49,022 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:49,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,092 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,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,106 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,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,107 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,160 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,179 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,180 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 32 states, 31 states have (on average 1.6774193548387097) internal successors, (in total 52), 31 states have internal predecessors, (52), 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 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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,299 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 32 states, 31 states have (on average 1.6774193548387097) internal successors, (in total 52), 31 states have internal predecessors, (52), 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 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 128 states and 222 transitions. Complement of second has 8 states. [2025-04-26 18:38:49,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:38:49,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2025-04-26 18:38:49,309 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:38:49,311 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,311 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:38:49,311 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,312 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:38:49,312 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 222 transitions. [2025-04-26 18:38:49,320 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 18:38:49,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 42 states and 79 transitions. [2025-04-26 18:38:49,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-04-26 18:38:49,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-04-26 18:38:49,326 INFO L74 IsDeterministic]: Start isDeterministic. Operand 42 states and 79 transitions. [2025-04-26 18:38:49,327 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:49,327 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 79 transitions. [2025-04-26 18:38:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 79 transitions. [2025-04-26 18:38:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2025-04-26 18:38:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.90625) internal successors, (in total 61), 31 states have internal predecessors, (61), 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,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. [2025-04-26 18:38:49,343 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 61 transitions. [2025-04-26 18:38:49,343 INFO L438 stractBuchiCegarLoop]: Abstraction has 32 states and 61 transitions. [2025-04-26 18:38:49,344 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:38:49,344 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 61 transitions. [2025-04-26 18:38:49,347 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 18:38:49,347 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:49,347 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:49,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:38:49,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:49,347 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0]" "[47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0]" "[38] L17-->fiveFINAL: Formula: (<= 4 v_x_7) InVars {x=v_x_7} OutVars{x=v_x_7} AuxVars[] AssignedVars[]" [2025-04-26 18:38:49,347 INFO L754 eck$LassoCheckResult]: Loop: "[35] L25-->L26: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:49,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1890821, now seen corresponding path program 1 times [2025-04-26 18:38:49,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:49,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522850000] [2025-04-26 18:38:49,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:49,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:49,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:49,355 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,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,379 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,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:49,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522850000] [2025-04-26 18:38:49,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522850000] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:49,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:49,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 18:38:49,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086253257] [2025-04-26 18:38:49,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:49,384 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:49,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2083, now seen corresponding path program 1 times [2025-04-26 18:38:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:49,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933503046] [2025-04-26 18:38:49,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:49,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:49,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,390 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,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:49,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,392 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,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:49,410 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:49,410 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:49,410 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:49,410 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:49,410 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:49,410 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,410 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:49,410 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:49,410 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 18:38:49,410 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:49,410 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:49,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:49,430 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:49,430 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:49,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,432 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,434 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,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:49,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:49,452 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,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,454 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,454 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,456 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:49,456 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:49,468 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:49,475 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,475 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:49,475 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:49,475 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:49,475 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:49,475 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:49,476 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,476 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:49,476 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:49,476 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 18:38:49,476 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:49,476 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:49,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:49,495 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:49,495 INFO L453 LassoAnalysis]: Using template 'affine'. [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 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,499 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,500 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,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:49,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:49,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:49,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:49,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:49,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:49,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:49,514 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:49,517 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:38:49,518 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:38:49,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,520 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,521 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,522 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:49,525 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,525 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,525 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:49,526 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:49,526 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2025-04-26 18:38:49,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:38:49,532 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:49,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:49,545 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,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,553 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,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,553 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,573 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,573 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,573 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 61 transitions. cyclomatic complexity: 39 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,600 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 61 transitions. cyclomatic complexity: 39. 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 53 states and 89 transitions. Complement of second has 7 states. [2025-04-26 18:38:49,600 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,601 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,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2025-04-26 18:38:49,601 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:38:49,601 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,601 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:38:49,601 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,601 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:38:49,601 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 89 transitions. [2025-04-26 18:38:49,602 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 18:38:49,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 34 states and 60 transitions. [2025-04-26 18:38:49,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-04-26 18:38:49,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-04-26 18:38:49,603 INFO L74 IsDeterministic]: Start isDeterministic. Operand 34 states and 60 transitions. [2025-04-26 18:38:49,603 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:49,603 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 60 transitions. [2025-04-26 18:38:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 60 transitions. [2025-04-26 18:38:49,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2025-04-26 18:38:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.8) internal successors, (in total 54), 29 states have internal predecessors, (54), 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,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 54 transitions. [2025-04-26 18:38:49,607 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 54 transitions. [2025-04-26 18:38:49,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:49,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:38:49,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:38:49,609 INFO L87 Difference]: Start difference. First operand 30 states and 54 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 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,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:49,631 INFO L93 Difference]: Finished difference Result 41 states and 66 transitions. [2025-04-26 18:38:49,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 66 transitions. [2025-04-26 18:38:49,632 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 18:38:49,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 34 states and 57 transitions. [2025-04-26 18:38:49,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-04-26 18:38:49,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-04-26 18:38:49,632 INFO L74 IsDeterministic]: Start isDeterministic. Operand 34 states and 57 transitions. [2025-04-26 18:38:49,632 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:49,632 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 57 transitions. [2025-04-26 18:38:49,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 57 transitions. [2025-04-26 18:38:49,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2025-04-26 18:38:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (in total 47), 26 states have internal predecessors, (47), 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,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2025-04-26 18:38:49,634 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 47 transitions. [2025-04-26 18:38:49,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:38:49,635 INFO L438 stractBuchiCegarLoop]: Abstraction has 27 states and 47 transitions. [2025-04-26 18:38:49,635 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:38:49,635 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 47 transitions. [2025-04-26 18:38:49,635 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 18:38:49,635 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:49,635 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:49,636 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:49,636 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:38:49,636 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0]" "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0]" "[35] L25-->L26: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:49,636 INFO L754 eck$LassoCheckResult]: Loop: "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[35] L25-->L26: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:49,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,636 INFO L85 PathProgramCache]: Analyzing trace with hash 487621057, now seen corresponding path program 1 times [2025-04-26 18:38:49,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:49,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956034533] [2025-04-26 18:38:49,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:49,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:49,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:49,641 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,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:49,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:49,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956034533] [2025-04-26 18:38:49,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956034533] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:38:49,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353154241] [2025-04-26 18:38:49,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:49,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:38:49,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,675 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:38:49,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-26 18:38:49,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:49,692 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,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:49,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:38:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353154241] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:38:49,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:38:49,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-04-26 18:38:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98083058] [2025-04-26 18:38:49,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:38:49,718 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:49,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2125893, now seen corresponding path program 1 times [2025-04-26 18:38:49,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:49,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034333715] [2025-04-26 18:38:49,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:49,718 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 4 statements into 1 equivalence classes. [2025-04-26 18:38:49,723 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,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:49,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 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 4 of 4 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 sat [2025-04-26 18:38:49,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:49,744 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:49,745 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:49,745 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:49,745 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:49,745 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:49,745 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,745 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:49,745 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:49,745 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 18:38:49,745 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:49,745 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:49,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:49,766 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:49,766 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:49,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,768 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,770 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,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:49,771 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:49,793 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,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,795 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,796 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,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:49,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:49,810 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:49,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:38:49,816 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:49,816 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:49,816 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:49,816 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:49,816 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:49,816 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,816 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:49,816 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:49,816 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 18:38:49,816 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:49,816 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:49,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:49,833 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:49,833 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:49,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,835 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,836 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,838 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,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:49,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:49,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:49,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:49,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:49,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:49,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:49,851 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:49,854 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:38:49,854 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:38:49,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,856 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,858 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,858 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:49,862 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,862 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:49,862 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:49,862 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2025-04-26 18:38:49,868 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,869 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:49,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:49,886 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,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:49,896 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,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,897 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,914 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,914 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:38:49,915 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 47 transitions. cyclomatic complexity: 27 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 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,978 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 47 transitions. cyclomatic complexity: 27. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 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 69 states and 121 transitions. Complement of second has 13 states. [2025-04-26 18:38:49,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-04-26 18:38:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 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,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2025-04-26 18:38:49,979 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:38:49,979 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,979 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:38:49,979 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,979 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 7 letters. Loop has 8 letters. [2025-04-26 18:38:49,979 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 121 transitions. [2025-04-26 18:38:49,980 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2025-04-26 18:38:49,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 58 states and 102 transitions. [2025-04-26 18:38:49,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-04-26 18:38:49,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-04-26 18:38:49,981 INFO L74 IsDeterministic]: Start isDeterministic. Operand 58 states and 102 transitions. [2025-04-26 18:38:49,981 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:49,981 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 102 transitions. [2025-04-26 18:38:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 102 transitions. [2025-04-26 18:38:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2025-04-26 18:38:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.8780487804878048) internal successors, (in total 77), 40 states have internal predecessors, (77), 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,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 77 transitions. [2025-04-26 18:38:49,983 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 77 transitions. [2025-04-26 18:38:49,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:49,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:38:49,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:38:49,984 INFO L87 Difference]: Start difference. First operand 41 states and 77 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:50,015 INFO L93 Difference]: Finished difference Result 64 states and 101 transitions. [2025-04-26 18:38:50,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 101 transitions. [2025-04-26 18:38:50,016 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2025-04-26 18:38:50,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 59 states and 95 transitions. [2025-04-26 18:38:50,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-04-26 18:38:50,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-04-26 18:38:50,017 INFO L74 IsDeterministic]: Start isDeterministic. Operand 59 states and 95 transitions. [2025-04-26 18:38:50,017 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:50,017 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 95 transitions. [2025-04-26 18:38:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 95 transitions. [2025-04-26 18:38:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2025-04-26 18:38:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.6842105263157894) internal successors, (in total 64), 37 states have internal predecessors, (64), 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,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2025-04-26 18:38:50,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 64 transitions. [2025-04-26 18:38:50,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:38:50,020 INFO L438 stractBuchiCegarLoop]: Abstraction has 38 states and 64 transitions. [2025-04-26 18:38:50,020 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:38:50,020 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 64 transitions. [2025-04-26 18:38:50,020 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2025-04-26 18:38:50,020 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:50,021 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:50,021 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2025-04-26 18:38:50,021 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 1, 1] [2025-04-26 18:38:50,021 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0]" "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0]" "[35] L25-->L26: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:50,021 INFO L754 eck$LassoCheckResult]: Loop: "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[35] L25-->L26: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:50,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1664976387, now seen corresponding path program 2 times [2025-04-26 18:38:50,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724383806] [2025-04-26 18:38:50,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:50,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-26 18:38:50,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:38:50,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:38:50,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,027 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:50,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:38:50,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:38:50,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:50,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,031 INFO L85 PathProgramCache]: Analyzing trace with hash 626188041, now seen corresponding path program 2 times [2025-04-26 18:38:50,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486149381] [2025-04-26 18:38:50,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:50,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-04-26 18:38:50,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:50,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:38:50,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,035 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:50,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:50,038 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,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:50,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,039 INFO L85 PathProgramCache]: Analyzing trace with hash 736730373, now seen corresponding path program 3 times [2025-04-26 18:38:50,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308867019] [2025-04-26 18:38:50,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:38:50,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 4 equivalence classes. [2025-04-26 18:38:50,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:38:50,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-26 18:38:50,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,055 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:50,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:38:50,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:38:50,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:50,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:38:50,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:38:50,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,141 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:50,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:38:50,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:38:50,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,160 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,171 INFO L201 PluginConnector]: Adding new model concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:38:50 BoogieIcfgContainer [2025-04-26 18:38:50,171 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:38:50,172 INFO L158 Benchmark]: Toolchain (without parser) took 1974.24ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 91.0MB in the beginning and 44.8MB in the end (delta: 46.3MB). Peak memory consumption was 26.5MB. Max. memory is 8.0GB. [2025-04-26 18:38:50,172 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.04ms. Allocated memory is still 163.6MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:50,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.82ms. Allocated memory is still 163.6MB. Free memory was 91.0MB in the beginning and 89.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:50,172 INFO L158 Benchmark]: Boogie Preprocessor took 21.30ms. Allocated memory is still 163.6MB. Free memory was 89.3MB in the beginning and 88.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:50,173 INFO L158 Benchmark]: RCFGBuilder took 137.73ms. Allocated memory is still 163.6MB. Free memory was 88.2MB in the beginning and 79.7MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:38:50,173 INFO L158 Benchmark]: BuchiAutomizer took 1782.64ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 79.7MB in the beginning and 44.8MB in the end (delta: 34.9MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. [2025-04-26 18:38:50,174 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 1.04ms. Allocated memory is still 163.6MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.82ms. Allocated memory is still 163.6MB. Free memory was 91.0MB in the beginning and 89.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.30ms. Allocated memory is still 163.6MB. Free memory was 89.3MB in the beginning and 88.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 137.73ms. Allocated memory is still 163.6MB. Free memory was 88.2MB in the beginning and 79.7MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1782.64ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 79.7MB in the beginning and 44.8MB in the end (delta: 34.9MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 4 iterations. TraceHistogramMax:3. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 59 StatesRemovedByMinimization, 5 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 37 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq186 hnf89 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 46ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 144, Number of transitions in reduction automaton: 52, Number of states in reduction automaton: 32, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 7 + -2 * x and consists of 5 locations. One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function x and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 38 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: 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] [L8] FORK 0 fork 1 five(); VAL [x=1] [L17] COND TRUE 1 x < 4 VAL [x=1] [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 VAL [x=2] [L18] 1 x := x + 1; VAL [x=3] [L17] COND TRUE 1 x < 4 VAL [x=3] [L18] 1 x := x + 1; VAL [x=4] [L9] FORK 0 fork 2 once(); VAL [x=4] [L25] COND TRUE 2 x == 4 VAL [x=4] [L26] 2 x := 1; VAL [x=1] Loop: [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L25] COND TRUE x == 4 [L26] x := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 five(); VAL [x=1] [L17] COND TRUE 1 x < 4 VAL [x=1] [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 VAL [x=2] [L18] 1 x := x + 1; VAL [x=3] [L17] COND TRUE 1 x < 4 VAL [x=3] [L18] 1 x := x + 1; VAL [x=4] [L9] FORK 0 fork 2 once(); VAL [x=4] [L25] COND TRUE 2 x == 4 VAL [x=4] [L26] 2 x := 1; VAL [x=1] Loop: [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L25] COND TRUE x == 4 [L26] x := 1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:38:50,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:50,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...