/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/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/termination/concurrent_ThreeThreadsAlternating_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:20:45,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:20:45,391 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:20:45,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:20:45,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:20:45,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:20:45,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:20:45,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:20:45,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:20:45,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:20:45,423 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:20:45,424 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:20:45,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:20:45,424 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:20:45,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:20:45,425 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:20:45,425 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:20:45,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:20:45,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:20:45,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:20:45,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:20:45,425 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:20:45,425 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:20:45,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:20:45,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:20:45,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:20:45,660 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:20:45,660 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:20:45,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_ThreeThreadsAlternating_nonterminating.bpl [2025-04-26 16:20:45,666 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_ThreeThreadsAlternating_nonterminating.bpl' [2025-04-26 16:20:45,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:20:45,677 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:20:45,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:45,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:20:45,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:20:45,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,706 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:20:45,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:45,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:20:45,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:20:45,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:20:45,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,715 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:20:45,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:20:45,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:20:45,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:20:45,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:45,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:45,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:45,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:20:45,783 INFO L124 BoogieDeclarations]: Specification and implementation of procedure one given in one single declaration [2025-04-26 16:20:45,784 INFO L130 BoogieDeclarations]: Found specification of procedure one [2025-04-26 16:20:45,784 INFO L138 BoogieDeclarations]: Found implementation of procedure one [2025-04-26 16:20:45,784 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:20:45,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:20:45,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:20:45,784 INFO L124 BoogieDeclarations]: Specification and implementation of procedure three given in one single declaration [2025-04-26 16:20:45,784 INFO L130 BoogieDeclarations]: Found specification of procedure three [2025-04-26 16:20:45,784 INFO L138 BoogieDeclarations]: Found implementation of procedure three [2025-04-26 16:20:45,784 INFO L124 BoogieDeclarations]: Specification and implementation of procedure two given in one single declaration [2025-04-26 16:20:45,784 INFO L130 BoogieDeclarations]: Found specification of procedure two [2025-04-26 16:20:45,784 INFO L138 BoogieDeclarations]: Found implementation of procedure two [2025-04-26 16:20:45,785 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:20:45,818 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:20:45,819 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:20:45,884 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:20:45,884 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:20:45,894 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:20:45,895 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:20:45,895 INFO L201 PluginConnector]: Adding new model concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:45 BoogieIcfgContainer [2025-04-26 16:20:45,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:20:45,896 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:20:45,896 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:20:45,902 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:20:45,902 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:45,903 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/2) ... [2025-04-26 16:20:45,904 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78ae56e3 and model type concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:20:45, skipping insertion in model container [2025-04-26 16:20:45,904 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:45,904 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:45" (2/2) ... [2025-04-26 16:20:45,905 INFO L376 chiAutomizerObserver]: Analyzing ICFG concurrent_ThreeThreadsAlternating_nonterminating.bpl [2025-04-26 16:20:45,955 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2025-04-26 16:20:45,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 32 transitions, 103 flow [2025-04-26 16:20:46,014 INFO L116 PetriNetUnfolderBase]: 8/29 cut-off events. [2025-04-26 16:20:46,015 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-26 16:20:46,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 29 events. 8/29 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 26. Up to 6 conditions per place. [2025-04-26 16:20:46,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 32 transitions, 103 flow [2025-04-26 16:20:46,026 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 26 transitions, 88 flow [2025-04-26 16:20:46,026 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 27 places, 26 transitions, 88 flow [2025-04-26 16:20:46,034 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:46,034 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:46,034 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:46,034 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:46,035 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:46,035 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:46,035 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:46,036 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:46,037 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:46,091 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 112 [2025-04-26 16:20:46,091 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:46,091 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:46,094 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:46,095 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:46,095 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:46,095 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 147 states, but on-demand construction may add more states [2025-04-26 16:20:46,101 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 112 [2025-04-26 16:20:46,101 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:46,101 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:46,101 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:46,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:46,105 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" [2025-04-26 16:20:46,105 INFO L754 eck$LassoCheckResult]: Loop: "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:46,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2295, now seen corresponding path program 1 times [2025-04-26 16:20:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910450641] [2025-04-26 16:20:46,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2025-04-26 16:20:46,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630519324] [2025-04-26 16:20:46,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,192 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2207097, now seen corresponding path program 1 times [2025-04-26 16:20:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682688635] [2025-04-26 16:20:46,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:46,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,208 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:46,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,261 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,262 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,262 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,262 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,262 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:46,262 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,262 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,263 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,263 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:46,263 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,263 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,322 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,323 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:46,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:46,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:20:46,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:46,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:46,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:46,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:20:46,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:46,357 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,381 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:46,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:46,387 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,387 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,387 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,387 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,387 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:46,387 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,387 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,387 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,387 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:46,387 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,387 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,418 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,421 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:46,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,424 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:46,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:20:46,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:46,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:46,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:46,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:46,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:46,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:46,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:46,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:46,450 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:46,455 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:46,455 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:20:46,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:46,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:20:46,462 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:46,464 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:20:46,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:20:46,466 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:46,466 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:46,467 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2025-04-26 16:20:46,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:46,476 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:46,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:46,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,522 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:46,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:46,606 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:20:46,608 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 147 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:46,812 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 147 states, but on-demand construction may add more states. 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 666 states and 2035 transitions. Complement of second has 7 states. [2025-04-26 16:20:46,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-04-26 16:20:46,821 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:20:46,822 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,822 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:20:46,822 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,822 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:20:46,822 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 666 states and 2035 transitions. [2025-04-26 16:20:46,842 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 110 [2025-04-26 16:20:46,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 666 states to 383 states and 1200 transitions. [2025-04-26 16:20:46,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2025-04-26 16:20:46,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 321 [2025-04-26 16:20:46,860 INFO L74 IsDeterministic]: Start isDeterministic. Operand 383 states and 1200 transitions. [2025-04-26 16:20:46,861 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:46,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 383 states and 1200 transitions. [2025-04-26 16:20:46,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states and 1200 transitions. [2025-04-26 16:20:46,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 201. [2025-04-26 16:20:46,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 201 states have (on average 3.1592039800995027) internal successors, (in total 635), 200 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 635 transitions. [2025-04-26 16:20:46,893 INFO L240 hiAutomatonCegarLoop]: Abstraction has 201 states and 635 transitions. [2025-04-26 16:20:46,893 INFO L438 stractBuchiCegarLoop]: Abstraction has 201 states and 635 transitions. [2025-04-26 16:20:46,893 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:46,893 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 635 transitions. [2025-04-26 16:20:46,895 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 110 [2025-04-26 16:20:46,896 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:46,896 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:46,896 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:20:46,896 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:46,897 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[49] L19-->oneFINAL: Formula: (not (= v_x_3 1)) InVars {x=v_x_3} OutVars{x=v_x_3} AuxVars[] AssignedVars[]" "[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" [2025-04-26 16:20:46,897 INFO L754 eck$LassoCheckResult]: Loop: "[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:46,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2207080, now seen corresponding path program 1 times [2025-04-26 16:20:46,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600863509] [2025-04-26 16:20:46,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:46,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:46,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:46,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600863509] [2025-04-26 16:20:46,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600863509] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:46,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:20:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900003098] [2025-04-26 16:20:46,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:46,926 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:46,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2819, now seen corresponding path program 1 times [2025-04-26 16:20:46,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402662031] [2025-04-26 16:20:46,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,951 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,951 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,951 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,951 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,951 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:46,951 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,951 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,951 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,951 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:46,951 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,951 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,968 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,968 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:46,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,970 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:46,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:20:46,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:46,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:20:46,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,997 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:46,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:20:47,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:47,001 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,013 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:47,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:20:47,019 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,019 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,019 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,019 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,019 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:47,019 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,019 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,019 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,019 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:47,019 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,019 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,040 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,040 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:47,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,042 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:20:47,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:47,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:47,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:47,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:47,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:47,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:47,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:47,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:47,061 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:47,063 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:47,063 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:20:47,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,065 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:20:47,067 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:47,070 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:20:47,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:47,071 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:47,071 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:47,071 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 5 Supporting invariants [] [2025-04-26 16:20:47,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:47,078 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:47,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:47,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:47,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:47,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,107 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,115 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:20:47,116 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 635 transitions. cyclomatic complexity: 492 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,239 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 635 transitions. cyclomatic complexity: 492. 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 1259 states and 3888 transitions. Complement of second has 9 states. [2025-04-26 16:20:47,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-04-26 16:20:47,240 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 75 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:20:47,240 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,240 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 75 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:20:47,240 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,240 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 75 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:20:47,241 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1259 states and 3888 transitions. [2025-04-26 16:20:47,257 INFO L131 ngComponentsAnalysis]: Automaton has 71 accepting balls. 168 [2025-04-26 16:20:47,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1259 states to 917 states and 2824 transitions. [2025-04-26 16:20:47,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 387 [2025-04-26 16:20:47,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2025-04-26 16:20:47,271 INFO L74 IsDeterministic]: Start isDeterministic. Operand 917 states and 2824 transitions. [2025-04-26 16:20:47,271 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,271 INFO L218 hiAutomatonCegarLoop]: Abstraction has 917 states and 2824 transitions. [2025-04-26 16:20:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states and 2824 transitions. [2025-04-26 16:20:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 543. [2025-04-26 16:20:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 543 states have (on average 3.32780847145488) internal successors, (in total 1807), 542 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1807 transitions. [2025-04-26 16:20:47,305 INFO L240 hiAutomatonCegarLoop]: Abstraction has 543 states and 1807 transitions. [2025-04-26 16:20:47,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:47,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:47,309 INFO L87 Difference]: Start difference. First operand 543 states and 1807 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 16:20:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,347 INFO L93 Difference]: Finished difference Result 688 states and 2045 transitions. [2025-04-26 16:20:47,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 688 states and 2045 transitions. [2025-04-26 16:20:47,353 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 152 [2025-04-26 16:20:47,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 688 states to 600 states and 1761 transitions. [2025-04-26 16:20:47,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2025-04-26 16:20:47,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2025-04-26 16:20:47,358 INFO L74 IsDeterministic]: Start isDeterministic. Operand 600 states and 1761 transitions. [2025-04-26 16:20:47,358 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,358 INFO L218 hiAutomatonCegarLoop]: Abstraction has 600 states and 1761 transitions. [2025-04-26 16:20:47,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states and 1761 transitions. [2025-04-26 16:20:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 524. [2025-04-26 16:20:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 524 states have (on average 3.0229007633587788) internal successors, (in total 1584), 523 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1584 transitions. [2025-04-26 16:20:47,370 INFO L240 hiAutomatonCegarLoop]: Abstraction has 524 states and 1584 transitions. [2025-04-26 16:20:47,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:47,371 INFO L438 stractBuchiCegarLoop]: Abstraction has 524 states and 1584 transitions. [2025-04-26 16:20:47,371 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:20:47,372 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 524 states and 1584 transitions. [2025-04-26 16:20:47,374 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 148 [2025-04-26 16:20:47,374 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,374 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,375 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,375 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:47,375 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[49] L19-->oneFINAL: Formula: (not (= v_x_3 1)) InVars {x=v_x_3} OutVars{x=v_x_3} AuxVars[] AssignedVars[]" [2025-04-26 16:20:47,375 INFO L754 eck$LassoCheckResult]: Loop: "[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:47,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2121035332, now seen corresponding path program 1 times [2025-04-26 16:20:47,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709002283] [2025-04-26 16:20:47,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2819, now seen corresponding path program 2 times [2025-04-26 16:20:47,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706260309] [2025-04-26 16:20:47,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:20:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:47,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:20:47,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:47,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1794509690, now seen corresponding path program 1 times [2025-04-26 16:20:47,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711984097] [2025-04-26 16:20:47,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:47,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:47,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,400 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:47,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:47,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,422 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,422 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,422 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,422 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,422 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:47,422 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,422 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,422 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,423 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 16:20:47,423 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,423 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,440 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,440 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:47,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,442 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:20:47,445 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:47,445 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:20:47,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,470 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:20:47,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:47,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,485 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:47,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:20:47,491 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,491 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,491 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,491 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,491 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:47,491 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,491 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,491 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,492 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 16:20:47,492 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,492 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,508 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,508 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:47,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,510 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:20:47,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:47,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:47,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:47,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:47,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:47,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:47,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:47,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:47,526 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:47,528 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:47,528 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:20:47,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,530 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:20:47,532 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:47,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:47,536 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:47,536 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:47,536 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 5 Supporting invariants [] [2025-04-26 16:20:47,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:47,543 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:47,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:47,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,580 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,587 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:20:47,588 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 524 states and 1584 transitions. cyclomatic complexity: 1164 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 16:20:47,647 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 524 states and 1584 transitions. cyclomatic complexity: 1164. 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 852 states and 2414 transitions. Complement of second has 9 states. [2025-04-26 16:20:47,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:47,648 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 16:20:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2025-04-26 16:20:47,648 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:20:47,648 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,648 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:20:47,648 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,648 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:20:47,648 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 852 states and 2414 transitions. [2025-04-26 16:20:47,654 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 148 [2025-04-26 16:20:47,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 852 states to 671 states and 1937 transitions. [2025-04-26 16:20:47,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2025-04-26 16:20:47,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 296 [2025-04-26 16:20:47,658 INFO L74 IsDeterministic]: Start isDeterministic. Operand 671 states and 1937 transitions. [2025-04-26 16:20:47,658 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,658 INFO L218 hiAutomatonCegarLoop]: Abstraction has 671 states and 1937 transitions. [2025-04-26 16:20:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states and 1937 transitions. [2025-04-26 16:20:47,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 523. [2025-04-26 16:20:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 523 states have (on average 3.0076481835564053) internal successors, (in total 1573), 522 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1573 transitions. [2025-04-26 16:20:47,672 INFO L240 hiAutomatonCegarLoop]: Abstraction has 523 states and 1573 transitions. [2025-04-26 16:20:47,672 INFO L438 stractBuchiCegarLoop]: Abstraction has 523 states and 1573 transitions. [2025-04-26 16:20:47,672 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:20:47,672 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 523 states and 1573 transitions. [2025-04-26 16:20:47,674 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 148 [2025-04-26 16:20:47,674 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,674 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,675 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,675 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:47,676 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[49] L19-->oneFINAL: Formula: (not (= v_x_3 1)) InVars {x=v_x_3} OutVars{x=v_x_3} AuxVars[] AssignedVars[]" [2025-04-26 16:20:47,676 INFO L754 eck$LassoCheckResult]: Loop: "[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" "[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" [2025-04-26 16:20:47,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1327586180, now seen corresponding path program 1 times [2025-04-26 16:20:47,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382692142] [2025-04-26 16:20:47,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:47,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:47,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,685 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:47,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:47,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2879, now seen corresponding path program 3 times [2025-04-26 16:20:47,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176799362] [2025-04-26 16:20:47,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:20:47,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:47,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:20:47,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176799362] [2025-04-26 16:20:47,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176799362] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:47,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:47,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:20:47,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902327737] [2025-04-26 16:20:47,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,709 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:20:47,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:47,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:47,709 INFO L87 Difference]: Start difference. First operand 523 states and 1573 transitions. cyclomatic complexity: 1154 Second operand has 3 states, 2 states have (on average 1.0) internal successors, (in total 2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,738 INFO L93 Difference]: Finished difference Result 420 states and 1068 transitions. [2025-04-26 16:20:47,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 420 states and 1068 transitions. [2025-04-26 16:20:47,741 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 75 [2025-04-26 16:20:47,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 420 states to 262 states and 660 transitions. [2025-04-26 16:20:47,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2025-04-26 16:20:47,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2025-04-26 16:20:47,742 INFO L74 IsDeterministic]: Start isDeterministic. Operand 262 states and 660 transitions. [2025-04-26 16:20:47,742 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 262 states and 660 transitions. [2025-04-26 16:20:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states and 660 transitions. [2025-04-26 16:20:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 139. [2025-04-26 16:20:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 2.647482014388489) internal successors, (in total 368), 138 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 368 transitions. [2025-04-26 16:20:47,746 INFO L240 hiAutomatonCegarLoop]: Abstraction has 139 states and 368 transitions. [2025-04-26 16:20:47,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:47,746 INFO L438 stractBuchiCegarLoop]: Abstraction has 139 states and 368 transitions. [2025-04-26 16:20:47,746 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:20:47,746 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 368 transitions. [2025-04-26 16:20:47,747 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 71 [2025-04-26 16:20:47,747 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,747 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,747 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,747 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,747 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" [2025-04-26 16:20:47,748 INFO L754 eck$LassoCheckResult]: Loop: "[54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:47,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2121022332, now seen corresponding path program 1 times [2025-04-26 16:20:47,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820149059] [2025-04-26 16:20:47,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,751 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1808230905, now seen corresponding path program 1 times [2025-04-26 16:20:47,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634062824] [2025-04-26 16:20:47,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,754 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash 199952706, now seen corresponding path program 1 times [2025-04-26 16:20:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875398158] [2025-04-26 16:20:47,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:20:47,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:20:47,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:20:47,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875398158] [2025-04-26 16:20:47,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875398158] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:47,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:47,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:20:47,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223207619] [2025-04-26 16:20:47,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:47,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:47,790 INFO L87 Difference]: Start difference. First operand 139 states and 368 transitions. cyclomatic complexity: 267 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,816 INFO L93 Difference]: Finished difference Result 160 states and 400 transitions. [2025-04-26 16:20:47,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 400 transitions. [2025-04-26 16:20:47,817 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 68 [2025-04-26 16:20:47,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 139 states and 346 transitions. [2025-04-26 16:20:47,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2025-04-26 16:20:47,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2025-04-26 16:20:47,818 INFO L74 IsDeterministic]: Start isDeterministic. Operand 139 states and 346 transitions. [2025-04-26 16:20:47,818 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,818 INFO L218 hiAutomatonCegarLoop]: Abstraction has 139 states and 346 transitions. [2025-04-26 16:20:47,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 346 transitions. [2025-04-26 16:20:47,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 118. [2025-04-26 16:20:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 2.4915254237288136) internal successors, (in total 294), 117 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 294 transitions. [2025-04-26 16:20:47,821 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 294 transitions. [2025-04-26 16:20:47,821 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:47,821 INFO L438 stractBuchiCegarLoop]: Abstraction has 118 states and 294 transitions. [2025-04-26 16:20:47,821 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:20:47,821 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 294 transitions. [2025-04-26 16:20:47,822 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 63 [2025-04-26 16:20:47,822 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,822 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,822 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,822 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" "[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:47,823 INFO L754 eck$LassoCheckResult]: Loop: "[54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:47,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1794490470, now seen corresponding path program 1 times [2025-04-26 16:20:47,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439598091] [2025-04-26 16:20:47,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:47,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:47,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:47,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:47,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1808230905, now seen corresponding path program 2 times [2025-04-26 16:20:47,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438280073] [2025-04-26 16:20:47,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:20:47,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-04-26 16:20:47,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:20:47,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,830 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,832 INFO L85 PathProgramCache]: Analyzing trace with hash -983328, now seen corresponding path program 2 times [2025-04-26 16:20:47,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656581141] [2025-04-26 16:20:47,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:20:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-26 16:20:47,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:20:47,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:20:47,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:20:47,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:20:47,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:47,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:47,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:47,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:47,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,909 INFO L201 PluginConnector]: Adding new model concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:20:47 BoogieIcfgContainer [2025-04-26 16:20:47,909 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:20:47,909 INFO L158 Benchmark]: Toolchain (without parser) took 2232.87ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.9MB in the beginning and 60.6MB in the end (delta: 26.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:20:47,910 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.35ms. Allocated memory is still 159.4MB. Free memory was 87.8MB in the beginning and 87.6MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:47,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.61ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 85.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:47,912 INFO L158 Benchmark]: Boogie Preprocessor took 23.41ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 84.0MB in the end (delta: 970.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:47,913 INFO L158 Benchmark]: RCFGBuilder took 162.73ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 75.4MB in the end (delta: 8.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:20:47,913 INFO L158 Benchmark]: BuchiAutomizer took 2013.15ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.2MB in the beginning and 60.6MB in the end (delta: 14.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:47,914 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.35ms. Allocated memory is still 159.4MB. Free memory was 87.8MB in the beginning and 87.6MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.61ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 85.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.41ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 84.0MB in the end (delta: 970.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 162.73ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 75.4MB in the end (delta: 8.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2013.15ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.2MB in the beginning and 60.6MB in the end (delta: 14.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 924 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 130 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 304 IncrementalHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 84 mSDtfsCounter, 304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT2 conc1 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq200 hnf87 smp100 dnf100 smp100 tf114 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 44ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 3 + -2 * x and consists of 4 locations. One deterministic module has affine ranking function 5 + -2 * x and consists of 5 locations. One deterministic module has affine ranking function 5 + -2 * x and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 118 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 35]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 one(); VAL [x=1] [L19] COND TRUE 1 x == 1 VAL [x=1] [L9] FORK 0 fork 2 two(); VAL [x=1] [L20] 1 x := 2; VAL [x=2] [L10] FORK 0 fork 3 three(); VAL [x=2] [L27] COND TRUE 2 x == 2 VAL [x=2] [L28] 2 x := 3; VAL [x=3] Loop: [L35] COND TRUE x == 3 [L36] x := 1; [L19] COND TRUE x == 1 [L20] x := 2; [L27] COND TRUE x == 2 [L28] x := 3; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 one(); VAL [x=1] [L19] COND TRUE 1 x == 1 VAL [x=1] [L9] FORK 0 fork 2 two(); VAL [x=1] [L20] 1 x := 2; VAL [x=2] [L10] FORK 0 fork 3 three(); VAL [x=2] [L27] COND TRUE 2 x == 2 VAL [x=2] [L28] 2 x := 3; VAL [x=3] Loop: [L35] COND TRUE x == 3 [L36] x := 1; [L19] COND TRUE x == 1 [L20] x := 2; [L27] COND TRUE x == 2 [L28] x := 3; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:20:47,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...