/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/termination/concurrent_TwoOne_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:20:45,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:20:45,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:20:45,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:20:45,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:20:45,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:20:45,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:20:45,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:20:45,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:20:45,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:20:45,441 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:20:45,442 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:20:45,442 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:20:45,442 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:20:45,442 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:20:45,442 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:20:45,442 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:20:45,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:20:45,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:20:45,443 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:20:45,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:20:45,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:20:45,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:20:45,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:20:45,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:20:45,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:20:45,443 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:20:45,443 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:20:45,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:20:45,443 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:20:45,443 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:20:45,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:20:45,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:20:45,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:20:45,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:20:45,444 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:20:45,444 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:20:45,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:20:45,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:20:45,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:20:45,687 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:20:45,687 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:20:45,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_TwoOne_nonterminating.bpl [2025-04-26 16:20:45,691 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_TwoOne_nonterminating.bpl' [2025-04-26 16:20:45,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:20:45,704 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:20:45,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:45,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:20:45,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:20:45,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,737 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:20:45,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:45,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:20:45,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:20:45,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:20:45,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,746 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:20:45,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:20:45,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:20:45,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:20:45,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:45,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:45,784 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,786 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,806 INFO L124 BoogieDeclarations]: Specification and implementation of procedure once given in one single declaration [2025-04-26 16:20:45,806 INFO L130 BoogieDeclarations]: Found specification of procedure once [2025-04-26 16:20:45,806 INFO L138 BoogieDeclarations]: Found implementation of procedure once [2025-04-26 16:20:45,806 INFO L124 BoogieDeclarations]: Specification and implementation of procedure double given in one single declaration [2025-04-26 16:20:45,806 INFO L130 BoogieDeclarations]: Found specification of procedure double [2025-04-26 16:20:45,806 INFO L138 BoogieDeclarations]: Found implementation of procedure double [2025-04-26 16:20:45,806 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:20:45,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:20:45,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:20:45,807 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,837 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:20:45,838 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:20:45,888 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:20:45,888 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:20:45,898 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:20:45,899 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:20:45,901 INFO L201 PluginConnector]: Adding new model concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:45 BoogieIcfgContainer [2025-04-26 16:20:45,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:20:45,902 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:20:45,902 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:20:45,907 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:20:45,908 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:45,908 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/2) ... [2025-04-26 16:20:45,909 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a48b545 and model type concurrent_TwoOne_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,909 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:45,909 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:45" (2/2) ... [2025-04-26 16:20:45,910 INFO L376 chiAutomizerObserver]: Analyzing ICFG concurrent_TwoOne_nonterminating.bpl [2025-04-26 16:20:45,959 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:20:45,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 20 transitions, 60 flow [2025-04-26 16:20:46,014 INFO L116 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-04-26 16:20:46,018 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:20:46,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 3/16 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2025-04-26 16:20:46,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 20 transitions, 60 flow [2025-04-26 16:20:46,030 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 16 transitions, 50 flow [2025-04-26 16:20:46,030 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 19 places, 16 transitions, 50 flow [2025-04-26 16:20:46,041 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:46,041 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:46,041 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:46,041 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:46,041 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:46,042 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:46,042 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:46,042 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:46,043 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:46,069 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18 [2025-04-26 16:20:46,069 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:46,069 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:46,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:46,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:46,073 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:46,073 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 31 states, but on-demand construction may add more states [2025-04-26 16:20:46,076 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18 [2025-04-26 16:20:46,077 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:46,077 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:46,077 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:46,077 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:46,082 INFO L752 eck$LassoCheckResult]: Stem: "[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x]" "[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0]" [2025-04-26 16:20:46,083 INFO L754 eck$LassoCheckResult]: Loop: "[39] L17-->L18: Formula: (< v_x_4 4) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:46,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2000, now seen corresponding path program 1 times [2025-04-26 16:20:46,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264818072] [2025-04-26 16:20:46,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,142 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,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,145 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,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2211, now seen corresponding path program 1 times [2025-04-26 16:20:46,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546325674] [2025-04-26 16:20:46,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,163 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,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,166 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,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1923250, now seen corresponding path program 1 times [2025-04-26 16:20:46,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634413173] [2025-04-26 16:20:46,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,174 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,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,174 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,177 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,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,220 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,220 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,220 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,220 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,223 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:46,223 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,223 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,223 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,224 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:46,224 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,224 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,281 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,282 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:46,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,286 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:46,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:20:46,289 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:46,289 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:20:46,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,314 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,315 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,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:46,320 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,352 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:46,356 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,357 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,357 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,357 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,357 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,357 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:46,357 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,357 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,357 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,357 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:46,357 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,357 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,390 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,392 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:46,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,396 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,398 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,399 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,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:46,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:46,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:46,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:46,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:46,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:46,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:46,421 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:46,426 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:46,426 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:20:46,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,431 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,433 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,433 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:46,437 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,437 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:46,438 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:46,438 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 7 Supporting invariants [] [2025-04-26 16:20:46,444 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,449 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:46,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,485 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,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:46,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,501 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,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,502 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:46,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,529 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,551 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,554 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 31 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:46,695 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 31 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 129 states and 254 transitions. Complement of second has 8 states. [2025-04-26 16:20:46,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2025-04-26 16:20:46,712 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:20:46,714 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,714 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:20:46,714 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,714 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:20:46,715 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 254 transitions. [2025-04-26 16:20:46,720 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:20:46,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 48 states and 97 transitions. [2025-04-26 16:20:46,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-04-26 16:20:46,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-04-26 16:20:46,744 INFO L74 IsDeterministic]: Start isDeterministic. Operand 48 states and 97 transitions. [2025-04-26 16:20:46,744 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:46,744 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 97 transitions. [2025-04-26 16:20:46,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 97 transitions. [2025-04-26 16:20:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2025-04-26 16:20:46,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (in total 72), 33 states have internal predecessors, (72), 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,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 72 transitions. [2025-04-26 16:20:46,802 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 72 transitions. [2025-04-26 16:20:46,803 INFO L438 stractBuchiCegarLoop]: Abstraction has 34 states and 72 transitions. [2025-04-26 16:20:46,803 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:46,803 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 72 transitions. [2025-04-26 16:20:46,804 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:20:46,804 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:46,804 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:46,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:20:46,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:46,805 INFO L752 eck$LassoCheckResult]: Stem: "[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x]" "[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0]" "[38] L17-->doubleFINAL: Formula: (<= 4 v_x_7) InVars {x=v_x_7} OutVars{x=v_x_7} AuxVars[] AssignedVars[]" "[44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0]" [2025-04-26 16:20:46,805 INFO L754 eck$LassoCheckResult]: Loop: "[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:46,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1923222, now seen corresponding path program 1 times [2025-04-26 16:20:46,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774372724] [2025-04-26 16:20:46,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,818 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,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,843 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,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:46,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774372724] [2025-04-26 16:20:46,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774372724] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:46,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:46,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:20:46,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714635523] [2025-04-26 16:20:46,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:46,848 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:46,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2083, now seen corresponding path program 1 times [2025-04-26 16:20:46,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132037922] [2025-04-26 16:20:46,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,855 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,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,856 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,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,875 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,875 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,875 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,875 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,875 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:46,875 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,875 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,875 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,875 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:46,875 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,875 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,897 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,898 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:46,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,901 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,902 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,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:46,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:46,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,929 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,931 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,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:46,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,946 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:46,952 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,953 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,953 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,953 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,953 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,953 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:46,953 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,953 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,953 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,953 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:46,953 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,953 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,977 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,977 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:46,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,979 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,981 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,982 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,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:46,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:46,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:46,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:46,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:46,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:46,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:47,000 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:47,002 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:47,002 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:20:47,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,004 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:20:47,005 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:47,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:20:47,008 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:47,008 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:47,008 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2025-04-26 16:20:47,013 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:47,014 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:47,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:47,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:47,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,040 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,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,040 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,058 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,059 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,059 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 72 transitions. cyclomatic complexity: 48 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,120 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 72 transitions. cyclomatic complexity: 48. 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 110 states and 219 transitions. Complement of second has 9 states. [2025-04-26 16:20:47,121 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,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2025-04-26 16:20:47,122 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:20:47,122 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,122 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:20:47,123 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,123 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:20:47,123 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 219 transitions. [2025-04-26 16:20:47,125 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18 [2025-04-26 16:20:47,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 63 states and 126 transitions. [2025-04-26 16:20:47,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-04-26 16:20:47,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-04-26 16:20:47,126 INFO L74 IsDeterministic]: Start isDeterministic. Operand 63 states and 126 transitions. [2025-04-26 16:20:47,126 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,126 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 126 transitions. [2025-04-26 16:20:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 126 transitions. [2025-04-26 16:20:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2025-04-26 16:20:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0384615384615383) internal successors, (in total 106), 51 states have internal predecessors, (106), 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,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 106 transitions. [2025-04-26 16:20:47,130 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 106 transitions. [2025-04-26 16:20:47,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:47,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:47,132 INFO L87 Difference]: Start difference. First operand 52 states and 106 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,155 INFO L93 Difference]: Finished difference Result 68 states and 116 transitions. [2025-04-26 16:20:47,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 116 transitions. [2025-04-26 16:20:47,156 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 16:20:47,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 53 states and 93 transitions. [2025-04-26 16:20:47,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-04-26 16:20:47,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-04-26 16:20:47,157 INFO L74 IsDeterministic]: Start isDeterministic. Operand 53 states and 93 transitions. [2025-04-26 16:20:47,157 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,157 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 93 transitions. [2025-04-26 16:20:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 93 transitions. [2025-04-26 16:20:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2025-04-26 16:20:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.875) internal successors, (in total 60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 60 transitions. [2025-04-26 16:20:47,162 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 60 transitions. [2025-04-26 16:20:47,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:47,163 INFO L438 stractBuchiCegarLoop]: Abstraction has 32 states and 60 transitions. [2025-04-26 16:20:47,163 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:20:47,163 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 60 transitions. [2025-04-26 16:20:47,164 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 16:20:47,164 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,164 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,164 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,164 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:20:47,165 INFO L752 eck$LassoCheckResult]: Stem: "[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x]" "[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0]" "[39] L17-->L18: Formula: (< v_x_4 4) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0]" "[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:47,165 INFO L754 eck$LassoCheckResult]: Loop: "[39] L17-->L18: Formula: (< v_x_4 4) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:47,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1461009308, now seen corresponding path program 1 times [2025-04-26 16:20:47,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006259756] [2025-04-26 16:20:47,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:47,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:47,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006259756] [2025-04-26 16:20:47,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006259756] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:20:47,199 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45182088] [2025-04-26 16:20:47,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:20:47,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,203 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-26 16:20:47,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:47,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:47,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:20:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45182088] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:20:47,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:20:47,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-26 16:20:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936227672] [2025-04-26 16:20:47,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,244 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:47,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2125893, now seen corresponding path program 1 times [2025-04-26 16:20:47,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62809304] [2025-04-26 16:20:47,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:47,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:47,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:47,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:47,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,268 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,268 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,269 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,269 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,269 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:47,269 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,269 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,269 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,269 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 16:20:47,269 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,269 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,288 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,288 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:47,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,293 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,294 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,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:47,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:20:47,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,314 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,316 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,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:47,317 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,329 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:47,335 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,336 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,336 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,336 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,336 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,336 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:47,336 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,336 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,336 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,336 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 16:20:47,336 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,336 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,353 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,353 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:47,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,355 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,357 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,358 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,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:47,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:47,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:47,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:47,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:47,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:47,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:47,372 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:47,375 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:47,375 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:20:47,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,377 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,379 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,380 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:47,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:47,383 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:47,383 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:47,384 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2025-04-26 16:20:47,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:20:47,390 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:47,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:47,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:47,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:47,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:47,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,422 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,443 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,444 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:20:47,444 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 60 transitions. cyclomatic complexity: 35 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,494 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 60 transitions. cyclomatic complexity: 35. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 74 states and 142 transitions. Complement of second has 11 states. [2025-04-26 16:20:47,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2025-04-26 16:20:47,495 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:20:47,495 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,495 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:20:47,495 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,495 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 7 letters. Loop has 8 letters. [2025-04-26 16:20:47,495 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 142 transitions. [2025-04-26 16:20:47,496 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2025-04-26 16:20:47,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 62 states and 118 transitions. [2025-04-26 16:20:47,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-04-26 16:20:47,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-04-26 16:20:47,497 INFO L74 IsDeterministic]: Start isDeterministic. Operand 62 states and 118 transitions. [2025-04-26 16:20:47,497 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 118 transitions. [2025-04-26 16:20:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 118 transitions. [2025-04-26 16:20:47,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2025-04-26 16:20:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.9565217391304348) internal successors, (in total 90), 45 states have internal predecessors, (90), 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,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2025-04-26 16:20:47,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 90 transitions. [2025-04-26 16:20:47,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:20:47,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:20:47,501 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,525 INFO L93 Difference]: Finished difference Result 65 states and 113 transitions. [2025-04-26 16:20:47,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 113 transitions. [2025-04-26 16:20:47,526 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2025-04-26 16:20:47,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 58 states and 103 transitions. [2025-04-26 16:20:47,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-04-26 16:20:47,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-04-26 16:20:47,527 INFO L74 IsDeterministic]: Start isDeterministic. Operand 58 states and 103 transitions. [2025-04-26 16:20:47,527 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,527 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 103 transitions. [2025-04-26 16:20:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 103 transitions. [2025-04-26 16:20:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 38. [2025-04-26 16:20:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (in total 70), 37 states have internal predecessors, (70), 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,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 70 transitions. [2025-04-26 16:20:47,529 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 70 transitions. [2025-04-26 16:20:47,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:20:47,530 INFO L438 stractBuchiCegarLoop]: Abstraction has 38 states and 70 transitions. [2025-04-26 16:20:47,530 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:20:47,530 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 70 transitions. [2025-04-26 16:20:47,531 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2025-04-26 16:20:47,531 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,531 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,531 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,531 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2025-04-26 16:20:47,531 INFO L752 eck$LassoCheckResult]: Stem: "[32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x]" "[47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0]" "[39] L17-->L18: Formula: (< v_x_4 4) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[39] L17-->L18: Formula: (< v_x_4 4) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0]" "[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:47,531 INFO L754 eck$LassoCheckResult]: Loop: "[39] L17-->L18: Formula: (< v_x_4 4) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[39] L17-->L18: Formula: (< v_x_4 4) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:47,532 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,532 INFO L85 PathProgramCache]: Analyzing trace with hash -428791814, now seen corresponding path program 2 times [2025-04-26 16:20:47,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548068339] [2025-04-26 16:20:47,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:20:47,532 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 9 statements into 2 equivalence classes. [2025-04-26 16:20:47,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:47,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 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 L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:47,539 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,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2043107303, now seen corresponding path program 2 times [2025-04-26 16:20:47,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153948309] [2025-04-26 16:20:47,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:20:47,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-04-26 16:20:47,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:20:47,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,550 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,552 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,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1905336032, now seen corresponding path program 3 times [2025-04-26 16:20:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149181932] [2025-04-26 16:20:47,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:20:47,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 3 equivalence classes. [2025-04-26 16:20:47,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:20:47,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:20:47,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:20:47,575 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,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:47,632 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,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:47,635 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,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,647 INFO L201 PluginConnector]: Adding new model concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:20:47 BoogieIcfgContainer [2025-04-26 16:20:47,647 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:20:47,648 INFO L158 Benchmark]: Toolchain (without parser) took 1943.50ms. Allocated memory is still 155.2MB. Free memory was 84.6MB in the beginning and 55.5MB in the end (delta: 29.0MB). Peak memory consumption was 28.2MB. Max. memory is 8.0GB. [2025-04-26 16:20:47,648 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.84ms. Allocated memory is still 155.2MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:47,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.80ms. Allocated memory is still 155.2MB. Free memory was 84.4MB in the beginning and 82.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:47,648 INFO L158 Benchmark]: Boogie Preprocessor took 16.68ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 81.7MB in the end (delta: 943.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:47,648 INFO L158 Benchmark]: RCFGBuilder took 143.80ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 73.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:20:47,649 INFO L158 Benchmark]: BuchiAutomizer took 1745.44ms. Allocated memory is still 155.2MB. Free memory was 73.1MB in the beginning and 55.5MB in the end (delta: 17.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2025-04-26 16:20:47,649 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.84ms. Allocated memory is still 155.2MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.80ms. Allocated memory is still 155.2MB. Free memory was 84.4MB in the beginning and 82.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 16.68ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 81.7MB in the end (delta: 943.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 143.80ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 73.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1745.44ms. Allocated memory is still 155.2MB. Free memory was 73.1MB in the beginning and 55.5MB in the end (delta: 17.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 0.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 35 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq186 hnf89 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 44ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 7 + -2 * x and consists of 5 locations. One deterministic module has affine ranking function x and consists of 5 locations. One deterministic module has affine ranking function x and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 38 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 double(); VAL [x=1] [L17] COND TRUE 1 x < 4 VAL [x=1] [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 VAL [x=2] [L18] 1 x := x + 1; VAL [x=3] [L9] FORK 0 fork 2 once(); VAL [x=3] [L25] COND TRUE 2 x == 3 VAL [x=3] [L26] 2 x := 1; VAL [x=1] Loop: [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L25] COND TRUE x == 3 [L26] x := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 double(); VAL [x=1] [L17] COND TRUE 1 x < 4 VAL [x=1] [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 VAL [x=2] [L18] 1 x := x + 1; VAL [x=3] [L9] FORK 0 fork 2 once(); VAL [x=3] [L25] COND TRUE 2 x == 3 VAL [x=3] [L26] 2 x := 1; VAL [x=1] Loop: [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L25] COND TRUE x == 3 [L26] x := 1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:20:47,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:47,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...