/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/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:20:44,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:20:44,976 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:44,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:20:44,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:20:45,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:20:45,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:20:45,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:20:45,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:20:45,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:20:45,005 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:20:45,005 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:20:45,005 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:20:45,005 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:20:45,005 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:20:45,005 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:20:45,005 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:20:45,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:20:45,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:20:45,005 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:20:45,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:20:45,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:20:45,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:20:45,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:20:45,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:20:45,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:20:45,006 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:20:45,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:20:45,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:20:45,006 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:20:45,006 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:20:45,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:20:45,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:20:45,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:20:45,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:20:45,006 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:20:45,006 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:20:45,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:20:45,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:20:45,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:20:45,245 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:20:45,246 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:20:45,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl [2025-04-26 16:20:45,249 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl' [2025-04-26 16:20:45,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:20:45,264 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:20:45,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:45,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:20:45,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:20:45,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,295 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:20:45,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:45,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:20:45,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:20:45,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:20:45,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,304 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:20:45,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:20:45,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:20:45,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:20:45,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:45,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:45,341 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,343 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,363 INFO L124 BoogieDeclarations]: Specification and implementation of procedure one given in one single declaration [2025-04-26 16:20:45,363 INFO L130 BoogieDeclarations]: Found specification of procedure one [2025-04-26 16:20:45,363 INFO L138 BoogieDeclarations]: Found implementation of procedure one [2025-04-26 16:20:45,363 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:20:45,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:20:45,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:20:45,364 INFO L124 BoogieDeclarations]: Specification and implementation of procedure three given in one single declaration [2025-04-26 16:20:45,364 INFO L130 BoogieDeclarations]: Found specification of procedure three [2025-04-26 16:20:45,364 INFO L138 BoogieDeclarations]: Found implementation of procedure three [2025-04-26 16:20:45,364 INFO L124 BoogieDeclarations]: Specification and implementation of procedure two given in one single declaration [2025-04-26 16:20:45,364 INFO L130 BoogieDeclarations]: Found specification of procedure two [2025-04-26 16:20:45,364 INFO L138 BoogieDeclarations]: Found implementation of procedure two [2025-04-26 16:20:45,365 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,397 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:20:45,399 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:20:45,468 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:20:45,468 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:20:45,477 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:20:45,477 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:20:45,479 INFO L201 PluginConnector]: Adding new model Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:45 BoogieIcfgContainer [2025-04-26 16:20:45,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:20:45,480 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:20:45,480 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:20:45,484 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:20:45,485 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:45,485 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/2) ... [2025-04-26 16:20:45,487 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7866b4f and model type Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:20:45, skipping insertion in model container [2025-04-26 16:20:45,487 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:45,487 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:45" (2/2) ... [2025-04-26 16:20:45,488 INFO L376 chiAutomizerObserver]: Analyzing ICFG Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl [2025-04-26 16:20:45,531 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2025-04-26 16:20:45,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 34 transitions, 107 flow [2025-04-26 16:20:45,586 INFO L116 PetriNetUnfolderBase]: 8/31 cut-off events. [2025-04-26 16:20:45,590 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-26 16:20:45,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 31 events. 8/31 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 27. Up to 6 conditions per place. [2025-04-26 16:20:45,595 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 34 transitions, 107 flow [2025-04-26 16:20:45,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 28 transitions, 92 flow [2025-04-26 16:20:45,600 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 28 transitions, 92 flow [2025-04-26 16:20:45,608 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:45,609 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:45,609 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:45,609 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:45,609 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:45,609 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:45,609 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:45,609 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:45,611 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:45,672 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 142 [2025-04-26 16:20:45,672 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:45,672 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:45,675 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:20:45,675 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:20:45,675 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:45,675 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 178 states, but on-demand construction may add more states [2025-04-26 16:20:45,684 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 142 [2025-04-26 16:20:45,684 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:45,684 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:45,684 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:20:45,685 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:20:45,688 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" [2025-04-26 16:20:45,688 INFO L754 eck$LassoCheckResult]: Loop: "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" [2025-04-26 16:20:45,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:45,693 INFO L85 PathProgramCache]: Analyzing trace with hash 75212, now seen corresponding path program 1 times [2025-04-26 16:20:45,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:45,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482909674] [2025-04-26 16:20:45,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:45,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:45,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:45,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:45,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,754 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:45,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:45,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:45,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:45,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:45,774 INFO L85 PathProgramCache]: Analyzing trace with hash 83478, now seen corresponding path program 1 times [2025-04-26 16:20:45,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:45,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601563344] [2025-04-26 16:20:45,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:45,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:45,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:45,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:45,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,786 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:45,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:45,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:45,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:45,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2054272917, now seen corresponding path program 1 times [2025-04-26 16:20:45,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:45,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164436095] [2025-04-26 16:20:45,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:45,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:45,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:45,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:45,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,804 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:45,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:45,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:45,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:45,883 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:45,884 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:45,885 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:45,885 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:45,885 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:45,886 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:45,886 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:45,886 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:45,886 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:45,886 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:45,887 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:45,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:45,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:45,971 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:45,972 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:45,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:45,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:45,976 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:45,978 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:45,979 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:45,979 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,000 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,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,003 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,005 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,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:46,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,032 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:46,037 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,037 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,037 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,037 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,037 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,037 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:46,037 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,037 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,037 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,037 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:46,037 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,037 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,084 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,087 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:46,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,090 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,092 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,093 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,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:46,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:46,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:46,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:46,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:46,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:46,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:46,111 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:46,115 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:46,115 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:20:46,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,118 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,121 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,122 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:46,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:46,125 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:46,126 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:46,126 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = -2*n + 7 Supporting invariants [] [2025-04-26 16:20:46,133 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,136 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:46,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:46,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:46,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:46,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:46,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:46,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:46,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,247 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,286 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,290 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 178 states, but on-demand construction may add more states 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:46,462 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 178 states, but on-demand construction may add more states. 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 672 states and 2104 transitions. Complement of second has 7 states. [2025-04-26 16:20:46,469 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,472 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:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-04-26 16:20:46,476 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:20:46,476 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,476 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:20:46,477 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,477 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:20:46,477 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 672 states and 2104 transitions. [2025-04-26 16:20:46,492 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 201 [2025-04-26 16:20:46,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 672 states to 425 states and 1335 transitions. [2025-04-26 16:20:46,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 265 [2025-04-26 16:20:46,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 337 [2025-04-26 16:20:46,505 INFO L74 IsDeterministic]: Start isDeterministic. Operand 425 states and 1335 transitions. [2025-04-26 16:20:46,505 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:46,505 INFO L218 hiAutomatonCegarLoop]: Abstraction has 425 states and 1335 transitions. [2025-04-26 16:20:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states and 1335 transitions. [2025-04-26 16:20:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 282. [2025-04-26 16:20:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 282 states have (on average 3.1631205673758864) internal successors, (in total 892), 281 states have internal predecessors, (892), 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,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 892 transitions. [2025-04-26 16:20:46,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 282 states and 892 transitions. [2025-04-26 16:20:46,542 INFO L438 stractBuchiCegarLoop]: Abstraction has 282 states and 892 transitions. [2025-04-26 16:20:46,542 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:46,542 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 892 transitions. [2025-04-26 16:20:46,544 INFO L131 ngComponentsAnalysis]: Automaton has 57 accepting balls. 163 [2025-04-26 16:20:46,544 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:46,544 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:46,544 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:20:46,544 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:46,545 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" [2025-04-26 16:20:46,545 INFO L754 eck$LassoCheckResult]: Loop: "[59] L29-->L30: Formula: (= 2 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[61] L30-->L29: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:46,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2331643, now seen corresponding path program 1 times [2025-04-26 16:20:46,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013272400] [2025-04-26 16:20:46,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,552 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,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,555 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,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2025-04-26 16:20:46,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063429384] [2025-04-26 16:20:46,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,560 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,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,560 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,561 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,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2054256483, now seen corresponding path program 1 times [2025-04-26 16:20:46,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145351915] [2025-04-26 16:20:46,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:46,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:46,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,604 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,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:46,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145351915] [2025-04-26 16:20:46,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145351915] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:46,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:46,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:20:46,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664867136] [2025-04-26 16:20:46,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:46,619 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,619 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,619 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,619 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,619 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:46,619 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,620 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,620 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,620 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:46,620 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,620 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,639 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,639 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:46,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,641 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,643 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,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:46,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,660 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,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,662 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,663 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:46,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:46,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,677 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:46,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:46,683 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,683 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,683 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,683 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,683 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:46,684 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,684 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,684 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,684 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:46,684 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,684 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,708 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,708 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:46,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,711 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:46,712 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:46,714 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,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:46,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:46,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:46,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:46,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:46,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:46,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:46,728 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:46,730 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 16:20:46,730 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:20:46,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,733 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:46,734 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:46,737 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:46,740 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:46,740 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:46,741 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:46,741 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2025-04-26 16:20:46,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:20:46,749 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:46,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,778 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,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:46,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,789 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,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,790 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:46,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,814 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,815 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,815 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282 states and 892 transitions. cyclomatic complexity: 682 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:46,925 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282 states and 892 transitions. cyclomatic complexity: 682. 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 1175 states and 3802 transitions. Complement of second has 7 states. [2025-04-26 16:20:46,926 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,927 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:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-26 16:20:46,927 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:20:46,927 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,927 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:20:46,927 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,927 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:20:46,927 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1175 states and 3802 transitions. [2025-04-26 16:20:46,943 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 225 [2025-04-26 16:20:46,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1175 states to 875 states and 2819 transitions. [2025-04-26 16:20:46,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 397 [2025-04-26 16:20:46,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 551 [2025-04-26 16:20:46,957 INFO L74 IsDeterministic]: Start isDeterministic. Operand 875 states and 2819 transitions. [2025-04-26 16:20:46,957 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:46,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 875 states and 2819 transitions. [2025-04-26 16:20:46,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states and 2819 transitions. [2025-04-26 16:20:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 578. [2025-04-26 16:20:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 578 states have (on average 3.4186851211072664) internal successors, (in total 1976), 577 states have internal predecessors, (1976), 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,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1976 transitions. [2025-04-26 16:20:46,987 INFO L240 hiAutomatonCegarLoop]: Abstraction has 578 states and 1976 transitions. [2025-04-26 16:20:46,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:46,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:46,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:46,990 INFO L87 Difference]: Start difference. First operand 578 states and 1976 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,033 INFO L93 Difference]: Finished difference Result 782 states and 2403 transitions. [2025-04-26 16:20:47,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 782 states and 2403 transitions. [2025-04-26 16:20:47,041 INFO L131 ngComponentsAnalysis]: Automaton has 65 accepting balls. 183 [2025-04-26 16:20:47,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 782 states to 553 states and 1692 transitions. [2025-04-26 16:20:47,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2025-04-26 16:20:47,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2025-04-26 16:20:47,046 INFO L74 IsDeterministic]: Start isDeterministic. Operand 553 states and 1692 transitions. [2025-04-26 16:20:47,046 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 553 states and 1692 transitions. [2025-04-26 16:20:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states and 1692 transitions. [2025-04-26 16:20:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 367. [2025-04-26 16:20:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 367 states have (on average 3.130790190735695) internal successors, (in total 1149), 366 states have internal predecessors, (1149), 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,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1149 transitions. [2025-04-26 16:20:47,056 INFO L240 hiAutomatonCegarLoop]: Abstraction has 367 states and 1149 transitions. [2025-04-26 16:20:47,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:47,058 INFO L438 stractBuchiCegarLoop]: Abstraction has 367 states and 1149 transitions. [2025-04-26 16:20:47,058 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:20:47,058 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 367 states and 1149 transitions. [2025-04-26 16:20:47,060 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 141 [2025-04-26 16:20:47,060 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,060 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:47,061 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[53] L20-->oneFINAL: Formula: (or (<= 4 v_n_4) (not (= v_x_3 1))) InVars {x=v_x_3, n=v_n_4} OutVars{x=v_x_3, n=v_n_4} AuxVars[] AssignedVars[]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" [2025-04-26 16:20:47,061 INFO L754 eck$LassoCheckResult]: Loop: "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 16:20:47,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2054273396, now seen corresponding path program 1 times [2025-04-26 16:20:47,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874324541] [2025-04-26 16:20:47,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,064 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,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,106 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,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874324541] [2025-04-26 16:20:47,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874324541] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:47,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:47,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:20:47,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961626814] [2025-04-26 16:20:47,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,107 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:47,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 1 times [2025-04-26 16:20:47,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120770724] [2025-04-26 16:20:47,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,112 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,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,114 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,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,128 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,129 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,129 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,129 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,129 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:47,129 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,129 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,129 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,129 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 16:20:47,129 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,129 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,150 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,150 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:47,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,155 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,156 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,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:47,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,179 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,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,181 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,182 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,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:47,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,199 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:47,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:47,205 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,205 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,205 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,205 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,205 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:47,205 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,205 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,205 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,205 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 16:20:47,205 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,205 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,224 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,224 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:47,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,226 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,227 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,229 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,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:47,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:47,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:47,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:47,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:47,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:47,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:47,242 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:47,245 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:47,245 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:20:47,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,247 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,249 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,249 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:47,252 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,253 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:47,253 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:47,253 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = 1*n Supporting invariants [] [2025-04-26 16:20:47,260 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,260 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:47,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,277 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,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,288 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,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,289 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,298 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,299 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,299 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 367 states and 1149 transitions. cyclomatic complexity: 848 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,383 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 367 states and 1149 transitions. cyclomatic complexity: 848. 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 1284 states and 4054 transitions. Complement of second has 9 states. [2025-04-26 16:20:47,384 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,384 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,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-04-26 16:20:47,385 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 71 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:20:47,385 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,385 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 71 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:20:47,385 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,385 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 71 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:20:47,385 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1284 states and 4054 transitions. [2025-04-26 16:20:47,396 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 154 [2025-04-26 16:20:47,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1284 states to 740 states and 2260 transitions. [2025-04-26 16:20:47,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2025-04-26 16:20:47,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 422 [2025-04-26 16:20:47,403 INFO L74 IsDeterministic]: Start isDeterministic. Operand 740 states and 2260 transitions. [2025-04-26 16:20:47,403 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,403 INFO L218 hiAutomatonCegarLoop]: Abstraction has 740 states and 2260 transitions. [2025-04-26 16:20:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states and 2260 transitions. [2025-04-26 16:20:47,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 564. [2025-04-26 16:20:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 564 states have (on average 3.120567375886525) internal successors, (in total 1760), 563 states have internal predecessors, (1760), 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,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1760 transitions. [2025-04-26 16:20:47,416 INFO L240 hiAutomatonCegarLoop]: Abstraction has 564 states and 1760 transitions. [2025-04-26 16:20:47,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:20:47,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:20:47,417 INFO L87 Difference]: Start difference. First operand 564 states and 1760 transitions. Second operand has 4 states, 4 states have (on average 1.5) 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,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,477 INFO L93 Difference]: Finished difference Result 879 states and 2560 transitions. [2025-04-26 16:20:47,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 879 states and 2560 transitions. [2025-04-26 16:20:47,491 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 155 [2025-04-26 16:20:47,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 879 states to 826 states and 2402 transitions. [2025-04-26 16:20:47,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 428 [2025-04-26 16:20:47,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 440 [2025-04-26 16:20:47,498 INFO L74 IsDeterministic]: Start isDeterministic. Operand 826 states and 2402 transitions. [2025-04-26 16:20:47,498 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,498 INFO L218 hiAutomatonCegarLoop]: Abstraction has 826 states and 2402 transitions. [2025-04-26 16:20:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states and 2402 transitions. [2025-04-26 16:20:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 692. [2025-04-26 16:20:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 692 states have (on average 3.0115606936416186) internal successors, (in total 2084), 691 states have internal predecessors, (2084), 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,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 2084 transitions. [2025-04-26 16:20:47,513 INFO L240 hiAutomatonCegarLoop]: Abstraction has 692 states and 2084 transitions. [2025-04-26 16:20:47,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:20:47,514 INFO L438 stractBuchiCegarLoop]: Abstraction has 692 states and 2084 transitions. [2025-04-26 16:20:47,514 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:20:47,514 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 692 states and 2084 transitions. [2025-04-26 16:20:47,518 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 143 [2025-04-26 16:20:47,518 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,518 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,519 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,519 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:47,519 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[53] L20-->oneFINAL: Formula: (or (<= 4 v_n_4) (not (= v_x_3 1))) InVars {x=v_x_3, n=v_n_4} OutVars{x=v_x_3, n=v_n_4} AuxVars[] AssignedVars[]" [2025-04-26 16:20:47,519 INFO L754 eck$LassoCheckResult]: Loop: "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 16:20:47,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,520 INFO L85 PathProgramCache]: Analyzing trace with hash 158426315, now seen corresponding path program 1 times [2025-04-26 16:20:47,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703985103] [2025-04-26 16:20:47,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:47,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:47,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:47,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:47,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 2 times [2025-04-26 16:20:47,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641850658] [2025-04-26 16:20:47,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:20:47,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,536 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,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:20:47,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,536 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,537 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,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1923835373, now seen corresponding path program 1 times [2025-04-26 16:20:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719978447] [2025-04-26 16:20:47,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:20:47,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:20:47,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,575 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,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719978447] [2025-04-26 16:20:47,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719978447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:47,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:47,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:20:47,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431972014] [2025-04-26 16:20:47,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,585 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,585 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,585 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,585 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,585 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:47,585 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,585 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,585 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,585 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration4_Loop [2025-04-26 16:20:47,585 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,585 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,601 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,601 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:47,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,604 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:20:47,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:47,606 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:20:47,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,632 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:20:47,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:47,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,646 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:47,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:47,652 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,652 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,652 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,652 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,652 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:47,652 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,652 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,652 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,652 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration4_Loop [2025-04-26 16:20:47,652 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,652 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,674 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,674 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:47,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,676 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:20:47,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:47,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:47,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:47,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:47,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:47,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:47,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:47,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:47,691 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:47,693 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:47,693 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:20:47,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,695 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:20:47,697 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:47,700 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:20:47,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:47,701 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:47,701 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:47,701 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = 1*n Supporting invariants [] [2025-04-26 16:20:47,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:47,706 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:47,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:47,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:47,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,735 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,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,735 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,743 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,743 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,744 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 692 states and 2084 transitions. cyclomatic complexity: 1459 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,783 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 692 states and 2084 transitions. cyclomatic complexity: 1459. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 839 states and 2458 transitions. Complement of second has 7 states. [2025-04-26 16:20:47,784 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:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2025-04-26 16:20:47,785 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:20:47,785 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,785 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:20:47,785 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,785 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:20:47,785 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 839 states and 2458 transitions. [2025-04-26 16:20:47,791 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 143 [2025-04-26 16:20:47,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 839 states to 722 states and 2143 transitions. [2025-04-26 16:20:47,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 351 [2025-04-26 16:20:47,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 365 [2025-04-26 16:20:47,796 INFO L74 IsDeterministic]: Start isDeterministic. Operand 722 states and 2143 transitions. [2025-04-26 16:20:47,796 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 722 states and 2143 transitions. [2025-04-26 16:20:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 2143 transitions. [2025-04-26 16:20:47,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 692. [2025-04-26 16:20:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 692 states have (on average 2.9869942196531793) internal successors, (in total 2067), 691 states have internal predecessors, (2067), 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,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 2067 transitions. [2025-04-26 16:20:47,809 INFO L240 hiAutomatonCegarLoop]: Abstraction has 692 states and 2067 transitions. [2025-04-26 16:20:47,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:20:47,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:20:47,810 INFO L87 Difference]: Start difference. First operand 692 states and 2067 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,850 INFO L93 Difference]: Finished difference Result 1082 states and 2863 transitions. [2025-04-26 16:20:47,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1082 states and 2863 transitions. [2025-04-26 16:20:47,857 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 126 [2025-04-26 16:20:47,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1082 states to 829 states and 2254 transitions. [2025-04-26 16:20:47,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 412 [2025-04-26 16:20:47,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 494 [2025-04-26 16:20:47,862 INFO L74 IsDeterministic]: Start isDeterministic. Operand 829 states and 2254 transitions. [2025-04-26 16:20:47,862 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 829 states and 2254 transitions. [2025-04-26 16:20:47,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states and 2254 transitions. [2025-04-26 16:20:47,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 360. [2025-04-26 16:20:47,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 360 states have (on average 2.8916666666666666) internal successors, (in total 1041), 359 states have internal predecessors, (1041), 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,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 1041 transitions. [2025-04-26 16:20:47,870 INFO L240 hiAutomatonCegarLoop]: Abstraction has 360 states and 1041 transitions. [2025-04-26 16:20:47,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:20:47,870 INFO L438 stractBuchiCegarLoop]: Abstraction has 360 states and 1041 transitions. [2025-04-26 16:20:47,870 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:20:47,870 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 360 states and 1041 transitions. [2025-04-26 16:20:47,872 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 119 [2025-04-26 16:20:47,872 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,872 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2025-04-26 16:20:47,873 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 16:20:47,873 INFO L754 eck$LassoCheckResult]: Loop: "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 16:20:47,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,873 INFO L85 PathProgramCache]: Analyzing trace with hash -316089485, now seen corresponding path program 1 times [2025-04-26 16:20:47,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777561810] [2025-04-26 16:20:47,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:20:47,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:20:47,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777561810] [2025-04-26 16:20:47,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777561810] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:47,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:47,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:20:47,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859386755] [2025-04-26 16:20:47,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,889 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:47,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1954045827, now seen corresponding path program 1 times [2025-04-26 16:20:47,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110626008] [2025-04-26 16:20:47,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:47,892 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,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110626008] [2025-04-26 16:20:47,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110626008] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:47,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:47,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:20:47,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366042335] [2025-04-26 16:20:47,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,907 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:20:47,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:47,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:47,907 INFO L87 Difference]: Start difference. First operand 360 states and 1041 transitions. cyclomatic complexity: 709 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,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,927 INFO L93 Difference]: Finished difference Result 420 states and 1074 transitions. [2025-04-26 16:20:47,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 420 states and 1074 transitions. [2025-04-26 16:20:47,939 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2025-04-26 16:20:47,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 420 states to 146 states and 316 transitions. [2025-04-26 16:20:47,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2025-04-26 16:20:47,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2025-04-26 16:20:47,940 INFO L74 IsDeterministic]: Start isDeterministic. Operand 146 states and 316 transitions. [2025-04-26 16:20:47,940 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,940 INFO L218 hiAutomatonCegarLoop]: Abstraction has 146 states and 316 transitions. [2025-04-26 16:20:47,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 316 transitions. [2025-04-26 16:20:47,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2025-04-26 16:20:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 140 states have (on average 2.1714285714285713) internal successors, (in total 304), 139 states have internal predecessors, (304), 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,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 304 transitions. [2025-04-26 16:20:47,942 INFO L240 hiAutomatonCegarLoop]: Abstraction has 140 states and 304 transitions. [2025-04-26 16:20:47,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:47,943 INFO L438 stractBuchiCegarLoop]: Abstraction has 140 states and 304 transitions. [2025-04-26 16:20:47,943 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:20:47,943 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 304 transitions. [2025-04-26 16:20:47,944 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2025-04-26 16:20:47,944 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,944 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,944 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,944 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1] [2025-04-26 16:20:47,945 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" "[59] L29-->L30: Formula: (= 2 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[61] L30-->L29: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 16:20:47,945 INFO L754 eck$LassoCheckResult]: Loop: "[59] L29-->L30: Formula: (= 2 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[61] L30-->L29: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[59] L29-->L30: Formula: (= 2 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[61] L30-->L29: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 16:20:47,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash 140526987, now seen corresponding path program 1 times [2025-04-26 16:20:47,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605149939] [2025-04-26 16:20:47,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:20:47,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:20:47,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,949 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:20:47,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:20:47,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,952 INFO L85 PathProgramCache]: Analyzing trace with hash -490312829, now seen corresponding path program 1 times [2025-04-26 16:20:47,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317402167] [2025-04-26 16:20:47,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:20:47,956 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,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,956 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:20:47,957 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,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1049145869, now seen corresponding path program 2 times [2025-04-26 16:20:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797046646] [2025-04-26 16:20:47,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:20:47,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-26 16:20:47,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:20:47,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:20:47,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:20:47,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:20:47,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:48,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:20:48,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:20:48,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,107 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:48,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:20:48,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:20:48,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,130 INFO L201 PluginConnector]: Adding new model Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:20:48 BoogieIcfgContainer [2025-04-26 16:20:48,130 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:20:48,130 INFO L158 Benchmark]: Toolchain (without parser) took 2866.64ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.6MB in the beginning and 102.2MB in the end (delta: -15.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:48,131 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.93ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:48,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.68ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 84.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:48,131 INFO L158 Benchmark]: Boogie Preprocessor took 20.67ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 83.6MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:20:48,131 INFO L158 Benchmark]: RCFGBuilder took 159.69ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 74.7MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:20:48,131 INFO L158 Benchmark]: BuchiAutomizer took 2650.24ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.7MB in the beginning and 102.2MB in the end (delta: -27.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:48,132 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.93ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.68ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 84.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.67ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 83.6MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 159.69ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 74.7MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2650.24ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.7MB in the beginning and 102.2MB in the end (delta: -27.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 8. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 1441 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 277 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 354 IncrementalHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 149 mSDtfsCounter, 354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI1 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf89 smp100 dnf100 smp100 tf114 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 38ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 7 + -2 * n and consists of 4 locations. One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function n and consists of 5 locations. One deterministic module has affine ranking function n and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 140 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 29]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; VAL [x=1] [L7] 0 n := 1; VAL [n=1, x=1] [L9] FORK 0 fork 1 one(); VAL [n=1, x=1] [L20] COND TRUE 1 x == 1 && n < 4 VAL [n=1, x=1] [L10] FORK 0 fork 2 two(); VAL [n=1, x=1] [L21] 1 x := 2; VAL [n=1, x=2] [L22] 1 n := n + 1; VAL [n=2, x=2] [L11] FORK 0 fork 3 three(); VAL [n=2, x=2] [L29] COND TRUE 2 x == 2 VAL [n=2, x=2] [L30] 2 x := 1; VAL [n=2, x=1] [L20] COND TRUE 1 x == 1 && n < 4 VAL [n=2, x=1] [L21] 1 x := 2; VAL [n=2, x=2] [L22] 1 n := n + 1; VAL [n=3, x=2] [L37] COND TRUE 3 n == 3 VAL [n=3, x=2] [L38] 3 n := 1; VAL [n=1, x=2] Loop: [L29] COND TRUE x == 2 [L30] x := 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L22] n := n + 1; [L29] COND TRUE x == 2 [L30] x := 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L22] n := n + 1; [L37] COND TRUE n == 3 [L38] n := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L7] 0 n := 1; VAL [n=1, x=1] [L9] FORK 0 fork 1 one(); VAL [n=1, x=1] [L20] COND TRUE 1 x == 1 && n < 4 VAL [n=1, x=1] [L10] FORK 0 fork 2 two(); VAL [n=1, x=1] [L21] 1 x := 2; VAL [n=1, x=2] [L22] 1 n := n + 1; VAL [n=2, x=2] [L11] FORK 0 fork 3 three(); VAL [n=2, x=2] [L29] COND TRUE 2 x == 2 VAL [n=2, x=2] [L30] 2 x := 1; VAL [n=2, x=1] [L20] COND TRUE 1 x == 1 && n < 4 VAL [n=2, x=1] [L21] 1 x := 2; VAL [n=2, x=2] [L22] 1 n := n + 1; VAL [n=3, x=2] [L37] COND TRUE 3 n == 3 VAL [n=3, x=2] [L38] 3 n := 1; VAL [n=1, x=2] Loop: [L29] COND TRUE x == 2 [L30] x := 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L22] n := n + 1; [L29] COND TRUE x == 2 [L30] x := 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L22] n := n + 1; [L37] COND TRUE n == 3 [L38] n := 1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:20:48,144 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...