/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_increment_nonterminating2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:38:50,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:38:50,477 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:38:50,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:38:50,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:38:50,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:38:50,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:38:50,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:38:50,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:38:50,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:38:50,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:38:50,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:38:50,504 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:38:50,504 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:38:50,504 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:38:50,504 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:38:50,504 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:38:50,504 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:38:50,504 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:38:50,505 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:38:50,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:38:50,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:38:50,505 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:38:50,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:38:50,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:38:50,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:38:50,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:38:50,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:38:50,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:38:50,507 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:38:50,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:38:50,507 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:38:50,507 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:38:50,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:38:50,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:38:50,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:50,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:38:50,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:38:50,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:38:50,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:38:50,508 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:38:50,508 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:38:50,508 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:38:50,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:38:50,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:38:50,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:38:50,739 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:38:50,740 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:38:50,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_increment_nonterminating2.bpl [2025-04-26 18:38:50,741 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_increment_nonterminating2.bpl' [2025-04-26 18:38:50,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:38:50,756 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:38:50,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:50,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:38:50,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:38:50,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:50" (1/1) ... [2025-04-26 18:38:50,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:50" (1/1) ... [2025-04-26 18:38:50,790 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:38:50,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:50,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:38:50,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:38:50,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:38:50,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:50" (1/1) ... [2025-04-26 18:38:50,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:50" (1/1) ... [2025-04-26 18:38:50,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:50" (1/1) ... [2025-04-26 18:38:50,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:50" (1/1) ... [2025-04-26 18:38:50,798 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:50" (1/1) ... [2025-04-26 18:38:50,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:50" (1/1) ... [2025-04-26 18:38:50,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:50" (1/1) ... [2025-04-26 18:38:50,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:50" (1/1) ... [2025-04-26 18:38:50,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:50" (1/1) ... [2025-04-26 18:38:50,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:38:50,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:38:50,814 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:38:50,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:38:50,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:50" (1/1) ... [2025-04-26 18:38:50,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:50,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:50,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:50,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:38:50,878 INFO L124 BoogieDeclarations]: Specification and implementation of procedure dec given in one single declaration [2025-04-26 18:38:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure dec [2025-04-26 18:38:50,879 INFO L138 BoogieDeclarations]: Found implementation of procedure dec [2025-04-26 18:38:50,879 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:38:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:38:50,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:38:50,879 INFO L124 BoogieDeclarations]: Specification and implementation of procedure inc given in one single declaration [2025-04-26 18:38:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure inc [2025-04-26 18:38:50,879 INFO L138 BoogieDeclarations]: Found implementation of procedure inc [2025-04-26 18:38:50,880 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:38:50,917 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:38:50,919 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:38:50,991 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:38:50,992 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:38:51,001 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:38:51,002 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:38:51,003 INFO L201 PluginConnector]: Adding new model concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:51 BoogieIcfgContainer [2025-04-26 18:38:51,003 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:38:51,004 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:38:51,004 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:38:51,008 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:38:51,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:51,009 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:50" (1/2) ... [2025-04-26 18:38:51,011 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e722e5b and model type concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:38:51, skipping insertion in model container [2025-04-26 18:38:51,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:51,011 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:51" (2/2) ... [2025-04-26 18:38:51,013 INFO L376 chiAutomizerObserver]: Analyzing ICFG concurrent_increment_nonterminating2.bpl [2025-04-26 18:38:51,055 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:38:51,101 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:51,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:51,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:51,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:51,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:38:51,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 18 transitions, 50 flow [2025-04-26 18:38:51,175 INFO L116 PetriNetUnfolderBase]: 2/14 cut-off events. [2025-04-26 18:38:51,177 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:38:51,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 14 events. 2/14 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 13 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-26 18:38:51,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 18 transitions, 50 flow [2025-04-26 18:38:51,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 14 transitions, 40 flow [2025-04-26 18:38:51,184 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 19 places, 14 transitions, 40 flow [2025-04-26 18:38:51,185 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 19 places, 14 transitions, 40 flow [2025-04-26 18:38:51,193 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (in total 52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:51,193 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (in total 52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:51,195 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:51,267 WARN L140 AmpleReduction]: Number of pruned transitions: 6 [2025-04-26 18:38:51,267 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:38:51,267 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3 [2025-04-26 18:38:51,267 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:18 [2025-04-26 18:38:51,267 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:6 [2025-04-26 18:38:51,268 WARN L145 AmpleReduction]: Times succ was already a loop node:10 [2025-04-26 18:38:51,268 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:51,268 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:51,268 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (in total 46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:51,273 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:51,273 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:51,273 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:51,274 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:51,274 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:51,274 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:51,274 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:51,274 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:51,275 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (in total 46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:51,283 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 18:38:51,283 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:51,283 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:51,286 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:38:51,286 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:51,286 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:51,286 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (in total 46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:51,288 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 18:38:51,288 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:51,288 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:51,288 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:38:51,288 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:51,291 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" [2025-04-26 18:38:51,292 INFO L754 eck$LassoCheckResult]: Loop: "[35] L24-->L25: Formula: (< 0 (+ v_x_1 1)) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L25-->L24: Formula: (= v_x_3 (+ v_x_2 1)) InVars {x=v_x_3} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:51,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:51,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1873, now seen corresponding path program 1 times [2025-04-26 18:38:51,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:51,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305310414] [2025-04-26 18:38:51,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:51,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:51,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:51,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:51,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:51,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:51,351 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:51,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:51,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:51,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:51,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:51,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:51,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:51,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2083, now seen corresponding path program 1 times [2025-04-26 18:38:51,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:51,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000941679] [2025-04-26 18:38:51,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:51,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:51,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:51,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:51,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:51,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:51,380 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:51,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:51,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:51,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:51,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:51,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:51,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:51,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1801075, now seen corresponding path program 1 times [2025-04-26 18:38:51,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:51,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824177852] [2025-04-26 18:38:51,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:51,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:51,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:51,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:51,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:51,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:51,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:51,449 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824177852] [2025-04-26 18:38:51,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824177852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:51,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:51,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:38:51,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055212959] [2025-04-26 18:38:51,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:51,510 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:51,511 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:51,511 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:51,511 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:51,511 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:51,511 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:51,511 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:51,511 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:51,512 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration1_Loop [2025-04-26 18:38:51,512 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:51,512 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:51,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:51,583 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:51,584 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:51,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:51,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:51,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:51,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:38:51,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:51,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:51,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:38:51,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:51,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:51,610 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:51,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:38:51,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:51,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:51,637 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:51,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:38:51,641 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:51,641 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:51,641 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:51,641 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:51,641 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:51,644 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:51,645 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:51,645 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:51,645 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration1_Loop [2025-04-26 18:38:51,645 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:51,645 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:51,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:51,670 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:51,673 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:51,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:51,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:51,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:51,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:38:51,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:38:51,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:51,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:51,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:51,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:51,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:51,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:51,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:51,724 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:51,729 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:38:51,729 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:38:51,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:51,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:51,740 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:51,743 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:51,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:51,748 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:38:51,748 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:51,748 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:51,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:38:51,750 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 2*x + 1 Supporting invariants [] [2025-04-26 18:38:51,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:51,758 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:51,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:51,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:51,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:51,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:51,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:51,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:51,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:51,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:51,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:51,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:51,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:51,792 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:51,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:51,839 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:38:51,840 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (in total 46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:51,938 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (in total 46), 27 states have internal predecessors, (46), 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 196 transitions. Complement of second has 8 states. [2025-04-26 18:38:51,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:38:51,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2025-04-26 18:38:51,947 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:38:51,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:51,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:38:51,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:51,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:38:51,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:51,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 196 transitions. [2025-04-26 18:38:51,958 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 14 [2025-04-26 18:38:51,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 40 states and 76 transitions. [2025-04-26 18:38:51,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-04-26 18:38:51,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-04-26 18:38:51,964 INFO L74 IsDeterministic]: Start isDeterministic. Operand 40 states and 76 transitions. [2025-04-26 18:38:51,964 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:51,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 76 transitions. [2025-04-26 18:38:51,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 76 transitions. [2025-04-26 18:38:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2025-04-26 18:38:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (in total 58), 29 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 58 transitions. [2025-04-26 18:38:51,984 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 58 transitions. [2025-04-26 18:38:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:51,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:38:51,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:38:51,987 INFO L87 Difference]: Start difference. First operand 30 states and 58 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:52,012 INFO L93 Difference]: Finished difference Result 28 states and 44 transitions. [2025-04-26 18:38:52,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 44 transitions. [2025-04-26 18:38:52,013 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 14 [2025-04-26 18:38:52,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 42 transitions. [2025-04-26 18:38:52,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-04-26 18:38:52,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-04-26 18:38:52,013 INFO L74 IsDeterministic]: Start isDeterministic. Operand 26 states and 42 transitions. [2025-04-26 18:38:52,014 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:52,014 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 42 transitions. [2025-04-26 18:38:52,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 42 transitions. [2025-04-26 18:38:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2025-04-26 18:38:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (in total 35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2025-04-26 18:38:52,015 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 35 transitions. [2025-04-26 18:38:52,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:38:52,018 INFO L438 stractBuchiCegarLoop]: Abstraction has 21 states and 35 transitions. [2025-04-26 18:38:52,018 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:38:52,018 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 35 transitions. [2025-04-26 18:38:52,019 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 14 [2025-04-26 18:38:52,019 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:52,019 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:52,019 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:38:52,019 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:52,020 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" "[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1]" "[34] L24-->decFINAL: Formula: (<= (+ v_x_4 1) 0) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" [2025-04-26 18:38:52,020 INFO L754 eck$LassoCheckResult]: Loop: "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:52,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:52,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1801444, now seen corresponding path program 1 times [2025-04-26 18:38:52,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:52,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632297686] [2025-04-26 18:38:52,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:52,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:52,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:52,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:52,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:52,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:52,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:52,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:52,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:52,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2211, now seen corresponding path program 1 times [2025-04-26 18:38:52,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:52,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481489974] [2025-04-26 18:38:52,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:52,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:52,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:52,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:52,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:52,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:52,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:52,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:52,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1731188934, now seen corresponding path program 1 times [2025-04-26 18:38:52,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:52,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380159660] [2025-04-26 18:38:52,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:52,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:52,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:52,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:52,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,053 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:52,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:52,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:52,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:52,076 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:52,076 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:52,076 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:52,076 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:52,076 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:52,076 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,076 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:52,076 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:52,076 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration2_Loop [2025-04-26 18:38:52,077 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:52,077 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:52,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:52,099 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:52,099 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:52,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:52,102 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:52,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:38:52,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:52,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:52,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:52,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:52,123 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:52,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:38:52,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:52,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:52,153 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:52,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:52,158 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:52,158 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:52,158 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:52,158 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:52,158 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:52,158 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,158 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:52,158 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:52,158 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration2_Loop [2025-04-26 18:38:52,158 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:52,158 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:52,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:52,182 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:52,182 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:52,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:52,184 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:52,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:38:52,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:38:52,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:52,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:52,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:52,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:52,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:52,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:52,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:52,201 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:52,207 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:38:52,207 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:38:52,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:52,211 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:52,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:38:52,212 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:52,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:38:52,216 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:52,216 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:52,216 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -1*x Supporting invariants [] [2025-04-26 18:38:52,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:52,224 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:52,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:52,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:52,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:52,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:52,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:52,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:52,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:52,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:52,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:52,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:52,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:52,274 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:38:52,274 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 35 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,308 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 35 transitions. cyclomatic complexity: 20. 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 40 states and 62 transitions. Complement of second has 6 states. [2025-04-26 18:38:52,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:38:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2025-04-26 18:38:52,310 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:38:52,310 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:52,310 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:38:52,310 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:52,310 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:38:52,311 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:52,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 62 transitions. [2025-04-26 18:38:52,311 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-04-26 18:38:52,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 13 states and 20 transitions. [2025-04-26 18:38:52,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-04-26 18:38:52,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-04-26 18:38:52,312 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2025-04-26 18:38:52,312 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:52,312 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-04-26 18:38:52,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2025-04-26 18:38:52,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-04-26 18:38:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (in total 20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2025-04-26 18:38:52,314 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-04-26 18:38:52,314 INFO L438 stractBuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-04-26 18:38:52,314 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:38:52,314 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2025-04-26 18:38:52,315 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-04-26 18:38:52,315 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:52,315 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:52,315 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:38:52,315 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:52,315 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" "[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:52,315 INFO L754 eck$LassoCheckResult]: Loop: "[35] L24-->L25: Formula: (< 0 (+ v_x_1 1)) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L25-->L24: Formula: (= v_x_3 (+ v_x_2 1)) InVars {x=v_x_3} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:52,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:52,317 INFO L85 PathProgramCache]: Analyzing trace with hash 55844960, now seen corresponding path program 1 times [2025-04-26 18:38:52,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:52,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980929159] [2025-04-26 18:38:52,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:52,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:52,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:38:52,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:38:52,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,323 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:52,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:38:52,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:38:52,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:52,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:52,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2083, now seen corresponding path program 2 times [2025-04-26 18:38:52,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:52,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768891993] [2025-04-26 18:38:52,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:52,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:52,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:52,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:52,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:38:52,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,330 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:52,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:52,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:52,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:52,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2127400130, now seen corresponding path program 1 times [2025-04-26 18:38:52,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:52,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983965417] [2025-04-26 18:38:52,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:52,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:52,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:52,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:52,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:52,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:52,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983965417] [2025-04-26 18:38:52,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983965417] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:38:52,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316086696] [2025-04-26 18:38:52,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:52,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:38:52,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:52,374 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:38:52,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-26 18:38:52,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:52,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:52,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:52,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:38:52,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:52,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:38:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:52,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316086696] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:38:52,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:38:52,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-26 18:38:52,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279719272] [2025-04-26 18:38:52,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:38:52,456 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:52,456 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:52,456 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:52,456 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:52,456 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:52,456 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,456 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:52,456 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:52,456 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration3_Loop [2025-04-26 18:38:52,456 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:52,456 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:52,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:52,472 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:52,472 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:52,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:52,474 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:52,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:38:52,477 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:52,477 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:52,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:38:52,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:52,495 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:52,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:38:52,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:52,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:52,518 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:52,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:38:52,522 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:52,522 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:52,522 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:52,522 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:52,522 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:52,522 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,522 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:52,522 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:52,522 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration3_Loop [2025-04-26 18:38:52,522 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:52,522 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:52,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:52,543 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:52,543 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:52,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:52,545 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:52,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:38:52,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:38:52,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:52,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:52,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:52,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:52,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:52,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:52,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:52,560 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:52,562 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:38:52,563 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:38:52,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:52,565 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:52,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:38:52,566 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:52,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:38:52,570 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:52,574 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:52,574 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 2*x + 1 Supporting invariants [] [2025-04-26 18:38:52,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:52,580 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:52,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:52,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:38:52,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:38:52,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:52,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:52,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:52,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:52,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:52,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:52,610 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:52,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:52,623 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:38:52,623 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,649 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Result 42 states and 74 transitions. Complement of second has 8 states. [2025-04-26 18:38:52,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:38:52,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2025-04-26 18:38:52,650 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:38:52,650 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:52,650 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:38:52,651 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:52,651 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:38:52,651 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:52,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 74 transitions. [2025-04-26 18:38:52,651 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-04-26 18:38:52,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 23 states and 39 transitions. [2025-04-26 18:38:52,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-04-26 18:38:52,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-04-26 18:38:52,652 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23 states and 39 transitions. [2025-04-26 18:38:52,652 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:52,652 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 39 transitions. [2025-04-26 18:38:52,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 39 transitions. [2025-04-26 18:38:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-04-26 18:38:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (in total 35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2025-04-26 18:38:52,655 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 35 transitions. [2025-04-26 18:38:52,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:52,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:38:52,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:38:52,655 INFO L87 Difference]: Start difference. First operand 21 states and 35 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:52,677 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2025-04-26 18:38:52,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2025-04-26 18:38:52,678 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2025-04-26 18:38:52,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 23 transitions. [2025-04-26 18:38:52,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-04-26 18:38:52,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-04-26 18:38:52,678 INFO L74 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2025-04-26 18:38:52,678 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:52,678 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-04-26 18:38:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2025-04-26 18:38:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2025-04-26 18:38:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (in total 20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2025-04-26 18:38:52,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-04-26 18:38:52,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:38:52,683 INFO L438 stractBuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-04-26 18:38:52,683 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:38:52,683 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2025-04-26 18:38:52,684 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2025-04-26 18:38:52,684 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:52,684 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:52,684 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:38:52,684 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2025-04-26 18:38:52,684 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" "[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" [2025-04-26 18:38:52,684 INFO L754 eck$LassoCheckResult]: Loop: "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[35] L24-->L25: Formula: (< 0 (+ v_x_1 1)) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[37] L25-->L24: Formula: (= v_x_3 (+ v_x_2 1)) InVars {x=v_x_3} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:52,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:52,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1801449, now seen corresponding path program 1 times [2025-04-26 18:38:52,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:52,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727139622] [2025-04-26 18:38:52,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:52,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:52,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:52,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:52,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:52,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:52,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:52,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:52,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:52,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2098572503, now seen corresponding path program 1 times [2025-04-26 18:38:52,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:52,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595007960] [2025-04-26 18:38:52,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:52,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:52,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:52,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:52,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-26 18:38:52,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:52,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595007960] [2025-04-26 18:38:52,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595007960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:52,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:52,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:38:52,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872437004] [2025-04-26 18:38:52,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:52,708 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 18:38:52,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:52,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:38:52,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:38:52,709 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:52,719 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2025-04-26 18:38:52,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2025-04-26 18:38:52,720 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-04-26 18:38:52,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 18 transitions. [2025-04-26 18:38:52,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-04-26 18:38:52,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-04-26 18:38:52,720 INFO L74 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2025-04-26 18:38:52,720 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:52,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-04-26 18:38:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2025-04-26 18:38:52,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-04-26 18:38:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (in total 17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-04-26 18:38:52,721 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-04-26 18:38:52,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:38:52,722 INFO L438 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-04-26 18:38:52,722 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:38:52,722 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2025-04-26 18:38:52,722 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-04-26 18:38:52,722 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:52,722 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:52,722 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2025-04-26 18:38:52,722 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:52,723 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" "[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" [2025-04-26 18:38:52,723 INFO L754 eck$LassoCheckResult]: Loop: "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" [2025-04-26 18:38:52,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:52,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1731193799, now seen corresponding path program 2 times [2025-04-26 18:38:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:52,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726045647] [2025-04-26 18:38:52,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:52,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:52,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-04-26 18:38:52,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:52,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:38:52,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:52,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:52,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:52,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:52,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:52,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2271, now seen corresponding path program 2 times [2025-04-26 18:38:52,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:52,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832275794] [2025-04-26 18:38:52,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:52,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:52,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:52,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:52,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:38:52,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:52,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:52,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:52,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:52,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:52,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:52,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1524898597, now seen corresponding path program 3 times [2025-04-26 18:38:52,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:52,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325110871] [2025-04-26 18:38:52,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:38:52,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:52,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 3 equivalence classes. [2025-04-26 18:38:52,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:52,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 18:38:52,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:52,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:52,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325110871] [2025-04-26 18:38:52,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325110871] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:52,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:52,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:38:52,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279683348] [2025-04-26 18:38:52,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:52,794 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:52,794 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:52,794 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:52,794 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:52,794 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:52,794 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,794 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:52,794 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:52,794 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration5_Loop [2025-04-26 18:38:52,794 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:52,794 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:52,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:52,811 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:52,811 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:52,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:52,813 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:52,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:38:52,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:52,815 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:52,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:52,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:52,837 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:52,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:38:52,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:52,840 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:52,887 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:52,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:52,891 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:52,891 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:52,891 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:52,891 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:52,891 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:52,891 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,891 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:52,891 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:52,891 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration5_Loop [2025-04-26 18:38:52,891 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:52,891 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:52,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:52,909 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:52,909 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:52,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:52,911 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:52,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:38:52,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:38:52,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:52,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:52,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:52,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:52,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:52,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:52,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:52,926 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:52,928 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:38:52,928 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:38:52,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:52,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:52,929 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:52,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:38:52,931 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:52,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:38:52,934 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:52,934 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:52,934 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -1*x Supporting invariants [] [2025-04-26 18:38:52,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:52,939 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:52,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:52,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:52,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:52,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:52,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:52,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:52,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:52,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:52,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:52,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:52,962 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:52,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:52,969 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:38:52,970 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,991 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 40 states and 58 transitions. Complement of second has 7 states. [2025-04-26 18:38:52,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:38:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-04-26 18:38:52,993 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:38:52,993 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:52,993 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:38:52,993 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:52,993 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:38:52,993 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:52,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2025-04-26 18:38:52,994 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2025-04-26 18:38:52,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 31 states and 45 transitions. [2025-04-26 18:38:52,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-04-26 18:38:52,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-04-26 18:38:52,994 INFO L74 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2025-04-26 18:38:52,995 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:52,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2025-04-26 18:38:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2025-04-26 18:38:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2025-04-26 18:38:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (in total 32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2025-04-26 18:38:52,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 32 transitions. [2025-04-26 18:38:52,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:52,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:38:52,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:38:52,999 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:53,025 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2025-04-26 18:38:53,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2025-04-26 18:38:53,025 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 18:38:53,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 29 transitions. [2025-04-26 18:38:53,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-04-26 18:38:53,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-04-26 18:38:53,025 INFO L74 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2025-04-26 18:38:53,026 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:53,026 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-04-26 18:38:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2025-04-26 18:38:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2025-04-26 18:38:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (in total 19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2025-04-26 18:38:53,027 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-04-26 18:38:53,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:38:53,028 INFO L438 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-04-26 18:38:53,028 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:38:53,028 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2025-04-26 18:38:53,028 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-04-26 18:38:53,028 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:53,029 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:53,029 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2025-04-26 18:38:53,029 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:38:53,029 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" "[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" [2025-04-26 18:38:53,029 INFO L754 eck$LassoCheckResult]: Loop: "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[35] L24-->L25: Formula: (< 0 (+ v_x_1 1)) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L25-->L24: Formula: (= v_x_3 (+ v_x_2 1)) InVars {x=v_x_3} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" [2025-04-26 18:38:53,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:53,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1731193799, now seen corresponding path program 4 times [2025-04-26 18:38:53,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:53,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564364702] [2025-04-26 18:38:53,029 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:38:53,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:53,031 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6 statements into 2 equivalence classes. [2025-04-26 18:38:53,032 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:53,033 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:38:53,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:53,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:53,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:53,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:53,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:53,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:53,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:53,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:53,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2179773, now seen corresponding path program 2 times [2025-04-26 18:38:53,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:53,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331385035] [2025-04-26 18:38:53,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:53,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:53,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 2 equivalence classes. [2025-04-26 18:38:53,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:53,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:38:53,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:53,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:53,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:53,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:53,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:53,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:53,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:53,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:53,047 INFO L85 PathProgramCache]: Analyzing trace with hash 843701123, now seen corresponding path program 2 times [2025-04-26 18:38:53,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:53,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395647651] [2025-04-26 18:38:53,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:53,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:53,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-26 18:38:53,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:38:53,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:38:53,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:53,051 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:53,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:38:53,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:38:53,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:53,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:53,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:53,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:53,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:53,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:53,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:53,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:53,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:53,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:53,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:53,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:53,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:53,157 INFO L201 PluginConnector]: Adding new model concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:38:53 BoogieIcfgContainer [2025-04-26 18:38:53,157 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:38:53,157 INFO L158 Benchmark]: Toolchain (without parser) took 2401.72ms. Allocated memory was 184.5MB in the beginning and 125.8MB in the end (delta: -58.7MB). Free memory was 107.8MB in the beginning and 81.9MB in the end (delta: 25.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:53,157 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 184.5MB. Free memory is still 108.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:53,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.17ms. Allocated memory is still 184.5MB. Free memory was 107.8MB in the beginning and 105.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:53,158 INFO L158 Benchmark]: Boogie Preprocessor took 22.13ms. Allocated memory is still 184.5MB. Free memory was 105.8MB in the beginning and 105.0MB in the end (delta: 818.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:53,158 INFO L158 Benchmark]: RCFGBuilder took 189.05ms. Allocated memory is still 184.5MB. Free memory was 105.0MB in the beginning and 95.7MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:38:53,158 INFO L158 Benchmark]: BuchiAutomizer took 2152.57ms. Allocated memory was 184.5MB in the beginning and 125.8MB in the end (delta: -58.7MB). Free memory was 95.7MB in the beginning and 81.9MB in the end (delta: 13.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:53,159 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.22ms. Allocated memory is still 184.5MB. Free memory is still 108.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.17ms. Allocated memory is still 184.5MB. Free memory was 107.8MB in the beginning and 105.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.13ms. Allocated memory is still 184.5MB. Free memory was 105.8MB in the beginning and 105.0MB in the end (delta: 818.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 189.05ms. Allocated memory is still 184.5MB. Free memory was 105.0MB in the beginning and 95.7MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2152.57ms. Allocated memory was 184.5MB in the beginning and 125.8MB in the end (delta: -58.7MB). Free memory was 95.7MB in the beginning and 81.9MB in the end (delta: 13.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 36 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 141 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 41 mSDtfsCounter, 141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT1 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 75ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 171, Number of transitions in reduction automaton: 46, Number of states in reduction automaton: 28, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * x and consists of 4 locations. One deterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * x and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 14 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 33]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L13] 0 x := -2; VAL [x=-2] [L15] FORK 0 fork 1 dec(); VAL [x=-2] [L16] FORK 0 fork 2, 2 inc(); VAL [x=-2] [L32] COND TRUE 2 x < 0 VAL [x=-2] [L33] 2 x := x + 1; VAL [x=-1] [L32] COND TRUE 2 x < 0 VAL [x=-1] Loop: [L33] x := x + 1; [L24] COND TRUE x > -1 [L25] x := x - 1; [L32] COND TRUE x < 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 33]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L13] 0 x := -2; VAL [x=-2] [L15] FORK 0 fork 1 dec(); VAL [x=-2] [L16] FORK 0 fork 2, 2 inc(); VAL [x=-2] [L32] COND TRUE 2 x < 0 VAL [x=-2] [L33] 2 x := x + 1; VAL [x=-1] [L32] COND TRUE 2 x < 0 VAL [x=-1] Loop: [L33] x := x + 1; [L24] COND TRUE x > -1 [L25] x := x - 1; [L32] COND TRUE x < 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:38:53,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:53,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...