/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_TwoOne_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:14,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:14,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:14,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:14,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:14,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:53:14,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:14,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:14,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:14,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:14,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:14,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:14,526 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:14,526 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:14,526 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:14,526 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:14,526 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:14,526 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:14,526 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:14,526 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:14,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:14,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:14,526 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:14,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:14,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:14,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:14,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:14,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:14,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:14,527 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:14,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:14,527 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:14,527 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:14,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:14,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:14,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:14,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:14,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:14,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:14,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:14,527 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:14,528 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:14,528 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:14,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:14,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:14,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:14,751 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:14,752 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:14,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_TwoOne_nonterminating.bpl [2025-04-26 16:53:14,755 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_TwoOne_nonterminating.bpl' [2025-04-26 16:53:14,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:14,769 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:14,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:14,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:14,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:14,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:14" (1/1) ... [2025-04-26 16:53:14,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:14" (1/1) ... [2025-04-26 16:53:14,804 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:14,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:14,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:14,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:14,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:14,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:14" (1/1) ... [2025-04-26 16:53:14,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:14" (1/1) ... [2025-04-26 16:53:14,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:14" (1/1) ... [2025-04-26 16:53:14,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:14" (1/1) ... [2025-04-26 16:53:14,814 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:14" (1/1) ... [2025-04-26 16:53:14,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:14" (1/1) ... [2025-04-26 16:53:14,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:14" (1/1) ... [2025-04-26 16:53:14,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:14" (1/1) ... [2025-04-26 16:53:14,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:14" (1/1) ... [2025-04-26 16:53:14,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:14,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:14,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:14,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:14,823 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:14" (1/1) ... [2025-04-26 16:53:14,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:14,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:14,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:14,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:53:14,862 INFO L124 BoogieDeclarations]: Specification and implementation of procedure once given in one single declaration [2025-04-26 16:53:14,862 INFO L130 BoogieDeclarations]: Found specification of procedure once [2025-04-26 16:53:14,862 INFO L138 BoogieDeclarations]: Found implementation of procedure once [2025-04-26 16:53:14,862 INFO L124 BoogieDeclarations]: Specification and implementation of procedure double given in one single declaration [2025-04-26 16:53:14,862 INFO L130 BoogieDeclarations]: Found specification of procedure double [2025-04-26 16:53:14,862 INFO L138 BoogieDeclarations]: Found implementation of procedure double [2025-04-26 16:53:14,862 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:14,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:14,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:14,863 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:53:14,891 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:14,892 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:14,943 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:14,943 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:14,949 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:14,949 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:53:14,950 INFO L201 PluginConnector]: Adding new model concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:14 BoogieIcfgContainer [2025-04-26 16:53:14,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:14,950 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:14,950 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:14,955 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:14,956 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:14,956 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:14" (1/2) ... [2025-04-26 16:53:14,957 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e740c0e and model type concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:14, skipping insertion in model container [2025-04-26 16:53:14,957 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:14,957 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:14" (2/2) ... [2025-04-26 16:53:14,958 INFO L376 chiAutomizerObserver]: Analyzing ICFG concurrent_TwoOne_nonterminating.bpl [2025-04-26 16:53:14,991 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:53:15,027 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:15,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:15,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,030 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:53:15,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 20 transitions, 60 flow [2025-04-26 16:53:15,091 INFO L116 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-04-26 16:53:15,092 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:53:15,096 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 16:53:15,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 20 transitions, 60 flow [2025-04-26 16:53:15,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 16 transitions, 50 flow [2025-04-26 16:53:15,098 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 19 places, 16 transitions, 50 flow [2025-04-26 16:53:15,104 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:15,156 WARN L140 AmpleReduction]: Number of pruned transitions: 9 [2025-04-26 16:53:15,156 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:53:15,156 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 4 [2025-04-26 16:53:15,156 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:18 [2025-04-26 16:53:15,156 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:9 [2025-04-26 16:53:15,156 WARN L145 AmpleReduction]: Times succ was already a loop node:11 [2025-04-26 16:53:15,157 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:53:15,157 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:15,158 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 16:53:15,163 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:15,163 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:15,163 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:15,163 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:15,163 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:15,163 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:15,163 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:15,163 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:15,164 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 16:53:15,172 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18 [2025-04-26 16:53:15,172 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:15,172 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:15,174 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:53:15,174 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:15,174 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:15,174 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 16:53:15,175 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18 [2025-04-26 16:53:15,175 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:15,175 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:15,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:53:15,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:15,178 INFO L752 eck$LassoCheckResult]: Stem: "[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x]" "[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0]" [2025-04-26 16:53:15,179 INFO L754 eck$LassoCheckResult]: Loop: "[39] L17-->L18: Formula: (< v_x_4 4) InVars {x=v_x_4} OutVars{x=v_x_4} 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 16:53:15,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2000, now seen corresponding path program 1 times [2025-04-26 16:53:15,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405803292] [2025-04-26 16:53:15,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,231 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2211, now seen corresponding path program 1 times [2025-04-26 16:53:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90405877] [2025-04-26 16:53:15,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,255 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1923250, now seen corresponding path program 1 times [2025-04-26 16:53:15,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500339971] [2025-04-26 16:53:15,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:15,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:15,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,266 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:15,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:15,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,313 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,314 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,314 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,314 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,314 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:15,314 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,314 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,314 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,314 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:53:15,314 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,314 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,363 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,363 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:15,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:53:15,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:15,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:53:15,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,391 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:53:15,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:15,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,420 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:15,424 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 16:53:15,424 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,424 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,424 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,425 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,425 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:15,425 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,425 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,425 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,425 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:53:15,425 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,425 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,447 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,449 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:15,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:53:15,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:15,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:15,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:15,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:15,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:15,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:15,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:15,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:15,491 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:15,495 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:15,495 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:53:15,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,498 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:53:15,500 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:15,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:15,503 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:15,504 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:15,504 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 7 Supporting invariants [] [2025-04-26 16:53:15,509 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 16:53:15,511 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:15,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,575 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:15,619 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 16:53:15,621 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 16:53:15,742 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 119 states and 200 transitions. Complement of second has 8 states. [2025-04-26 16:53:15,743 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 16:53:15,747 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 16:53:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2025-04-26 16:53:15,750 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:53:15,750 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,750 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:53:15,751 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,751 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:53:15,751 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 200 transitions. [2025-04-26 16:53:15,760 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:53:15,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 47 states and 88 transitions. [2025-04-26 16:53:15,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-04-26 16:53:15,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-04-26 16:53:15,766 INFO L74 IsDeterministic]: Start isDeterministic. Operand 47 states and 88 transitions. [2025-04-26 16:53:15,766 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:15,766 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 88 transitions. [2025-04-26 16:53:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 88 transitions. [2025-04-26 16:53:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2025-04-26 16:53:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (in total 67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 67 transitions. [2025-04-26 16:53:15,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 67 transitions. [2025-04-26 16:53:15,786 INFO L438 stractBuchiCegarLoop]: Abstraction has 34 states and 67 transitions. [2025-04-26 16:53:15,787 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:15,787 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 67 transitions. [2025-04-26 16:53:15,788 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:53:15,788 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:15,788 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:15,789 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:53:15,789 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:15,790 INFO L752 eck$LassoCheckResult]: Stem: "[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x]" "[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0]" "[44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0]" "[38] L17-->doubleFINAL: Formula: (<= 4 v_x_7) InVars {x=v_x_7} OutVars{x=v_x_7} AuxVars[] AssignedVars[]" [2025-04-26 16:53:15,790 INFO L754 eck$LassoCheckResult]: Loop: "[35] L25-->L26: Formula: (= 3 v_x_1) 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 16:53:15,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1923402, now seen corresponding path program 1 times [2025-04-26 16:53:15,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,790 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425018910] [2025-04-26 16:53:15,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:15,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:15,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:15,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:15,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425018910] [2025-04-26 16:53:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425018910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:15,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:15,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:53:15,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253447184] [2025-04-26 16:53:15,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:15,822 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:15,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2083, now seen corresponding path program 1 times [2025-04-26 16:53:15,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033351651] [2025-04-26 16:53:15,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,842 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,842 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,842 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,842 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,842 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:15,842 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,843 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,843 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,843 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:53:15,843 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,843 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,860 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,860 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:15,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,862 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:53:15,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:15,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:15,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,888 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:53:15,890 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:15,890 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,902 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:15,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:15,908 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,908 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,908 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,908 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,908 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:15,908 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,908 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,908 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,908 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:53:15,908 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,908 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,925 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,925 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:15,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,927 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:53:15,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:15,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:15,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:15,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:15,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:15,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:15,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:15,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:15,943 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:15,946 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:15,946 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:53:15,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,948 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 16:53:15,949 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 16:53:15,949 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:15,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:53:15,953 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:15,953 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:15,953 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2025-04-26 16:53:15,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:15,959 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:15,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:15,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:15,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,983 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:16,003 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 16:53:16,003 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 67 transitions. cyclomatic complexity: 43 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 16:53:16,034 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 67 transitions. cyclomatic complexity: 43. 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 55 states and 95 transitions. Complement of second has 7 states. [2025-04-26 16:53:16,035 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 16:53:16,036 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 16:53:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2025-04-26 16:53:16,036 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:53:16,036 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,036 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:53:16,036 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,036 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:53:16,036 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 95 transitions. [2025-04-26 16:53:16,037 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:53:16,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 36 states and 66 transitions. [2025-04-26 16:53:16,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-04-26 16:53:16,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-04-26 16:53:16,038 INFO L74 IsDeterministic]: Start isDeterministic. Operand 36 states and 66 transitions. [2025-04-26 16:53:16,038 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:16,038 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 66 transitions. [2025-04-26 16:53:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 66 transitions. [2025-04-26 16:53:16,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-04-26 16:53:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.875) internal successors, (in total 60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 60 transitions. [2025-04-26 16:53:16,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 60 transitions. [2025-04-26 16:53:16,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:16,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:53:16,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:53:16,041 INFO L87 Difference]: Start difference. First operand 32 states and 60 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 16:53:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:16,058 INFO L93 Difference]: Finished difference Result 45 states and 74 transitions. [2025-04-26 16:53:16,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 74 transitions. [2025-04-26 16:53:16,059 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 16:53:16,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 36 states and 63 transitions. [2025-04-26 16:53:16,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-04-26 16:53:16,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-04-26 16:53:16,059 INFO L74 IsDeterministic]: Start isDeterministic. Operand 36 states and 63 transitions. [2025-04-26 16:53:16,060 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:16,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 63 transitions. [2025-04-26 16:53:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 63 transitions. [2025-04-26 16:53:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2025-04-26 16:53:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.8064516129032258) internal successors, (in total 56), 30 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 56 transitions. [2025-04-26 16:53:16,062 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 56 transitions. [2025-04-26 16:53:16,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:53:16,063 INFO L438 stractBuchiCegarLoop]: Abstraction has 31 states and 56 transitions. [2025-04-26 16:53:16,063 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:53:16,063 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 56 transitions. [2025-04-26 16:53:16,063 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 16:53:16,063 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:16,063 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:16,064 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:16,064 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:16,064 INFO L752 eck$LassoCheckResult]: Stem: "[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x]" "[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0]" "[39] L17-->L18: Formula: (< v_x_4 4) InVars {x=v_x_4} OutVars{x=v_x_4} 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]" "[44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0]" "[35] L25-->L26: Formula: (= 3 v_x_1) 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 16:53:16,064 INFO L754 eck$LassoCheckResult]: Loop: "[39] L17-->L18: Formula: (< v_x_4 4) InVars {x=v_x_4} OutVars{x=v_x_4} 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: (= 3 v_x_1) 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 16:53:16,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1461009308, now seen corresponding path program 1 times [2025-04-26 16:53:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120178058] [2025-04-26 16:53:16,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:16,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:16,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:16,089 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 16:53:16,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:16,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120178058] [2025-04-26 16:53:16,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120178058] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:53:16,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543687084] [2025-04-26 16:53:16,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:53:16,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,092 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 16:53:16,093 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 16:53:16,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:16,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:16,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:16,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:53:16,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:16,122 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 16:53:16,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:53:16,141 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 16:53:16,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543687084] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:53:16,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:53:16,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-26 16:53:16,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297568704] [2025-04-26 16:53:16,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:53:16,142 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:16,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2125893, now seen corresponding path program 1 times [2025-04-26 16:53:16,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667406838] [2025-04-26 16:53:16,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:16,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:16,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,145 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:16,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:16,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,174 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:16,174 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:16,174 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:16,174 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:16,174 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:16,174 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,174 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:16,175 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:16,175 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 16:53:16,175 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:16,175 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:16,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:16,194 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:16,194 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:16,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,207 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 16:53:16,209 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 16:53:16,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:16,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:16,227 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 16:53:16,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,228 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 16:53:16,229 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 16:53:16,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:16,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:16,243 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:16,248 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 16:53:16,249 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:16,249 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:16,249 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:16,249 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:16,249 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:16,249 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,249 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:16,249 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:16,249 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 16:53:16,250 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:16,250 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:16,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:16,269 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:16,270 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:16,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,272 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 16:53:16,273 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 16:53:16,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:16,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:16,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:16,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:16,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:16,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:16,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:16,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:16,287 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:16,289 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:16,289 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:53:16,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,291 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 16:53:16,292 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 16:53:16,293 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:16,296 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 16:53:16,296 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:16,296 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:16,296 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2025-04-26 16:53:16,301 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 16:53:16,302 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:16,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:16,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:16,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:16,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:16,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:16,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:16,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:16,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:16,332 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:53:16,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:16,348 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 16:53:16,348 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 56 transitions. cyclomatic complexity: 32 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 16:53:16,394 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 56 transitions. cyclomatic complexity: 32. 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 71 states and 127 transitions. Complement of second has 11 states. [2025-04-26 16:53:16,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:16,395 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 16:53:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2025-04-26 16:53:16,395 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:53:16,395 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,395 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:53:16,395 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,395 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 7 letters. Loop has 8 letters. [2025-04-26 16:53:16,396 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 127 transitions. [2025-04-26 16:53:16,397 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2025-04-26 16:53:16,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 60 states and 108 transitions. [2025-04-26 16:53:16,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-04-26 16:53:16,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-04-26 16:53:16,397 INFO L74 IsDeterministic]: Start isDeterministic. Operand 60 states and 108 transitions. [2025-04-26 16:53:16,397 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:16,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 108 transitions. [2025-04-26 16:53:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 108 transitions. [2025-04-26 16:53:16,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2025-04-26 16:53:16,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.9111111111111112) internal successors, (in total 86), 44 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 86 transitions. [2025-04-26 16:53:16,403 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 86 transitions. [2025-04-26 16:53:16,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:16,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:53:16,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:53:16,404 INFO L87 Difference]: Start difference. First operand 45 states and 86 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:16,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:16,428 INFO L93 Difference]: Finished difference Result 60 states and 101 transitions. [2025-04-26 16:53:16,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 101 transitions. [2025-04-26 16:53:16,429 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2025-04-26 16:53:16,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 54 states and 92 transitions. [2025-04-26 16:53:16,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-04-26 16:53:16,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-04-26 16:53:16,430 INFO L74 IsDeterministic]: Start isDeterministic. Operand 54 states and 92 transitions. [2025-04-26 16:53:16,430 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:16,430 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 92 transitions. [2025-04-26 16:53:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 92 transitions. [2025-04-26 16:53:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2025-04-26 16:53:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.7837837837837838) internal successors, (in total 66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:16,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2025-04-26 16:53:16,432 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 66 transitions. [2025-04-26 16:53:16,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:53:16,433 INFO L438 stractBuchiCegarLoop]: Abstraction has 37 states and 66 transitions. [2025-04-26 16:53:16,433 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:53:16,433 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 66 transitions. [2025-04-26 16:53:16,433 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2025-04-26 16:53:16,433 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:16,433 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:16,433 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-04-26 16:53:16,433 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2025-04-26 16:53:16,434 INFO L752 eck$LassoCheckResult]: Stem: "[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x]" "[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0]" "[39] L17-->L18: Formula: (< v_x_4 4) InVars {x=v_x_4} OutVars{x=v_x_4} 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_4 4) InVars {x=v_x_4} OutVars{x=v_x_4} 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]" "[44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0]" "[35] L25-->L26: Formula: (= 3 v_x_1) 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 16:53:16,434 INFO L754 eck$LassoCheckResult]: Loop: "[39] L17-->L18: Formula: (< v_x_4 4) InVars {x=v_x_4} OutVars{x=v_x_4} 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_4 4) InVars {x=v_x_4} OutVars{x=v_x_4} 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: (= 3 v_x_1) 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 16:53:16,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,434 INFO L85 PathProgramCache]: Analyzing trace with hash -428791814, now seen corresponding path program 2 times [2025-04-26 16:53:16,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148108937] [2025-04-26 16:53:16,434 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:16,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-26 16:53:16,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:16,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:16,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:16,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:16,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2043107303, now seen corresponding path program 2 times [2025-04-26 16:53:16,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047073973] [2025-04-26 16:53:16,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:16,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-04-26 16:53:16,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:16,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:16,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:16,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:16,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1905336032, now seen corresponding path program 3 times [2025-04-26 16:53:16,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458525370] [2025-04-26 16:53:16,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:53:16,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 3 equivalence classes. [2025-04-26 16:53:16,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:16,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:53:16,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:16,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:16,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:16,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:16,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:16,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:16,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:53:16,542 INFO L201 PluginConnector]: Adding new model concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:53:16 BoogieIcfgContainer [2025-04-26 16:53:16,542 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:53:16,543 INFO L158 Benchmark]: Toolchain (without parser) took 1774.20ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.7MB in the beginning and 56.3MB in the end (delta: 30.5MB). Peak memory consumption was 26.5MB. Max. memory is 8.0GB. [2025-04-26 16:53:16,543 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.81ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:16,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.64ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:16,544 INFO L158 Benchmark]: Boogie Preprocessor took 14.94ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:16,544 INFO L158 Benchmark]: RCFGBuilder took 127.65ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 74.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:53:16,544 INFO L158 Benchmark]: BuchiAutomizer took 1592.20ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.6MB in the beginning and 56.3MB in the end (delta: 18.4MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. [2025-04-26 16:53:16,545 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.81ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.64ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 14.94ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 127.65ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 74.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1592.20ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.6MB in the beginning and 56.3MB in the end (delta: 18.4MB). 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.5s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 0.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 54 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, 52 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 34 mSDtfsCounter, 112 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: 54ms 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]: 134, 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 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 37 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 double(); 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] [L9] FORK 0 fork 2 once(); VAL [x=3] [L25] COND TRUE 2 x == 3 VAL [x=3] [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; [L25] COND TRUE x == 3 [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 double(); 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] [L9] FORK 0 fork 2 once(); VAL [x=3] [L25] COND TRUE 2 x == 3 VAL [x=3] [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; [L25] COND TRUE x == 3 [L26] x := 1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:53:16,556 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 16:53:16,756 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...