/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 /storage/cav23-termute-examples/2_thr/bb3_b.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:12,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:12,226 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:24:12,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:12,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:12,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:12,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:12,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:12,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:12,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:12,257 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:12,257 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:12,257 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:12,257 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:12,257 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:12,257 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:12,257 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:12,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:12,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:12,257 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:12,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:12,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:12,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:12,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:12,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:12,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:12,258 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:12,258 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:12,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:12,258 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:12,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:12,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:12,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:12,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:12,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:12,258 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:12,258 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:12,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:12,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:12,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:12,490 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:12,491 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:12,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/bb3_b.c.bpl [2025-04-26 16:24:12,493 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/bb3_b.c.bpl' [2025-04-26 16:24:12,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:12,508 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:12,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:12,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:12,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:12,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,545 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:12,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:12,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:12,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:12,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:12,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:12,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:12,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:12,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:12,563 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:12,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:12,588 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:24:12,591 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:24:12,612 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:12,613 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:12,613 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:12,613 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:12,613 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:12,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:12,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:12,614 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:24:12,647 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:12,648 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:12,730 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:12,730 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:12,740 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:12,741 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:12,741 INFO L201 PluginConnector]: Adding new model bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:12 BoogieIcfgContainer [2025-04-26 16:24:12,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:12,743 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:12,743 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:12,747 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:12,748 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:12,748 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/2) ... [2025-04-26 16:24:12,749 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50063a06 and model type bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:12, skipping insertion in model container [2025-04-26 16:24:12,749 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:12,749 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:12" (2/2) ... [2025-04-26 16:24:12,750 INFO L376 chiAutomizerObserver]: Analyzing ICFG bb3_b.c.bpl [2025-04-26 16:24:12,794 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:24:12,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 70 flow [2025-04-26 16:24:12,851 INFO L116 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-04-26 16:24:12,854 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:24:12,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 4/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:24:12,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 28 transitions, 70 flow [2025-04-26 16:24:12,859 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 24 transitions, 60 flow [2025-04-26 16:24:12,859 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 27 places, 24 transitions, 60 flow [2025-04-26 16:24:12,869 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:12,869 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:12,869 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:12,869 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:12,869 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:12,870 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:12,870 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:12,870 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:12,871 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:12,901 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 56 [2025-04-26 16:24:12,901 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:12,901 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:12,904 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:12,904 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:12,904 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:12,904 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 83 states, but on-demand construction may add more states [2025-04-26 16:24:12,907 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 56 [2025-04-26 16:24:12,907 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:12,907 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:12,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:12,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:12,911 INFO L752 eck$LassoCheckResult]: Stem: "[56] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[82] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:12,911 INFO L754 eck$LassoCheckResult]: Loop: "[63] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[65] L24-->L22: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:12,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:12,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2779, now seen corresponding path program 1 times [2025-04-26 16:24:12,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:12,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598079362] [2025-04-26 16:24:12,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:12,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:12,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:12,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:12,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:12,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:12,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:12,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:12,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:12,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:12,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:12,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:12,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:12,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 1 times [2025-04-26 16:24:12,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:12,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436198775] [2025-04-26 16:24:12,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:12,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:12,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:12,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:12,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:12,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:12,990 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:12,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:12,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:12,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:12,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:12,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:12,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:12,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2672637, now seen corresponding path program 1 times [2025-04-26 16:24:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:12,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144638579] [2025-04-26 16:24:12,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:12,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:13,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:13,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:13,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:13,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:13,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:13,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:13,050 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:13,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:13,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:13,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:13,051 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:13,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:13,051 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:13,052 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb3_b.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:13,052 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:13,052 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:13,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:13,102 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:13,103 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:13,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,106 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:24:13,108 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:24:13,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:13,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:13,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:13,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,132 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:24:13,135 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:24:13,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:13,136 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:13,212 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:13,216 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:24:13,217 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:13,217 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:13,217 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:13,217 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:13,217 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:13,217 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,217 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:13,217 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:13,217 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb3_b.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:13,217 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:13,217 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:13,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:13,248 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:13,251 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:13,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,254 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:24:13,256 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:24:13,257 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:24:13,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:13,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:13,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:13,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:13,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:13,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:13,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:13,279 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:13,284 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:13,284 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:13,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,288 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:24:13,289 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:24:13,291 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:13,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:24:13,295 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:13,295 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:13,296 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 16:24:13,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:24:13,305 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:13,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:13,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:13,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:13,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:13,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:13,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:13,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:13,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:13,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:13,361 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:13,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:13,385 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:24:13,422 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:24:13,426 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 83 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:24:13,603 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 83 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 261 states and 589 transitions. Complement of second has 7 states. [2025-04-26 16:24:13,604 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:24:13,608 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:24:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-04-26 16:24:13,614 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 71 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:13,615 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:13,616 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 71 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:13,616 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:13,616 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 71 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:13,617 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:13,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 261 states and 589 transitions. [2025-04-26 16:24:13,627 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 50 [2025-04-26 16:24:13,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 261 states to 137 states and 312 transitions. [2025-04-26 16:24:13,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2025-04-26 16:24:13,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2025-04-26 16:24:13,636 INFO L74 IsDeterministic]: Start isDeterministic. Operand 137 states and 312 transitions. [2025-04-26 16:24:13,637 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:13,637 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 312 transitions. [2025-04-26 16:24:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 312 transitions. [2025-04-26 16:24:13,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 110. [2025-04-26 16:24:13,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 2.3454545454545452) internal successors, (in total 258), 109 states have internal predecessors, (258), 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:24:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 258 transitions. [2025-04-26 16:24:13,665 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 258 transitions. [2025-04-26 16:24:13,665 INFO L438 stractBuchiCegarLoop]: Abstraction has 110 states and 258 transitions. [2025-04-26 16:24:13,665 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:13,665 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 258 transitions. [2025-04-26 16:24:13,667 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 50 [2025-04-26 16:24:13,668 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:13,668 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:13,668 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:13,668 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:13,668 INFO L752 eck$LassoCheckResult]: Stem: "[56] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[82] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[85] L13-1-->L37: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:24:13,668 INFO L754 eck$LassoCheckResult]: Loop: "[72] L37-->L39: Formula: (< v_x3_5 v_z_5) InVars {x3=v_x3_5, z=v_z_5} OutVars{x3=v_x3_5, z=v_z_5} AuxVars[] AssignedVars[]" "[74] L39-->L37: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-04-26 16:24:13,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:13,669 INFO L85 PathProgramCache]: Analyzing trace with hash 86234, now seen corresponding path program 1 times [2025-04-26 16:24:13,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:13,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108881074] [2025-04-26 16:24:13,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:13,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:13,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:13,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:13,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,672 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:13,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:13,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:13,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:13,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 1 times [2025-04-26 16:24:13,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:13,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509250425] [2025-04-26 16:24:13,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:13,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:13,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:13,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:13,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,682 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:13,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:13,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:13,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:13,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:13,685 INFO L85 PathProgramCache]: Analyzing trace with hash 82873180, now seen corresponding path program 1 times [2025-04-26 16:24:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:13,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809192921] [2025-04-26 16:24:13,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:13,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:13,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:13,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:13,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:13,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:13,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:13,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:13,721 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:13,721 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:13,721 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:13,721 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:13,721 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:13,721 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,721 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:13,721 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:13,721 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb3_b.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:13,721 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:13,721 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:13,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:13,745 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:13,745 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:13,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,748 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:24:13,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:24:13,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:13,751 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:13,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:24:13,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,771 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:24:13,772 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:24:13,774 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:13,774 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:13,840 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:13,844 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:24:13,844 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:13,844 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:13,844 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:13,844 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:13,844 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:13,844 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,844 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:13,844 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:13,845 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb3_b.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:13,845 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:13,845 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:13,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:13,867 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:13,867 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:13,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,872 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:24:13,873 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:24:13,874 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:24:13,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:13,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:13,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:13,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:13,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:13,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:13,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:13,887 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:13,889 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:13,889 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:13,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,892 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:24:13,893 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:24:13,894 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:13,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:13,897 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:13,897 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:13,897 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:24:13,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:13,904 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:13,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:13,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:13,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:13,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:13,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:13,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:13,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:13,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:13,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:13,933 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:13,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:13,951 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:24:13,952 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:24:13,952 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 258 transitions. cyclomatic complexity: 178 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:14,012 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 258 transitions. cyclomatic complexity: 178. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 346 states and 834 transitions. Complement of second has 7 states. [2025-04-26 16:24:14,013 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:24:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-26 16:24:14,013 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:14,013 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:14,013 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:14,013 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:14,014 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:24:14,014 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:14,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 346 states and 834 transitions. [2025-04-26 16:24:14,018 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 22 [2025-04-26 16:24:14,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 346 states to 222 states and 535 transitions. [2025-04-26 16:24:14,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-04-26 16:24:14,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2025-04-26 16:24:14,025 INFO L74 IsDeterministic]: Start isDeterministic. Operand 222 states and 535 transitions. [2025-04-26 16:24:14,025 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:14,025 INFO L218 hiAutomatonCegarLoop]: Abstraction has 222 states and 535 transitions. [2025-04-26 16:24:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 535 transitions. [2025-04-26 16:24:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 173. [2025-04-26 16:24:14,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 173 states have (on average 2.514450867052023) internal successors, (in total 435), 172 states have internal predecessors, (435), 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:24:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 435 transitions. [2025-04-26 16:24:14,039 INFO L240 hiAutomatonCegarLoop]: Abstraction has 173 states and 435 transitions. [2025-04-26 16:24:14,039 INFO L438 stractBuchiCegarLoop]: Abstraction has 173 states and 435 transitions. [2025-04-26 16:24:14,039 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:14,039 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 435 transitions. [2025-04-26 16:24:14,041 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 22 [2025-04-26 16:24:14,041 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:14,041 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:14,041 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:14,041 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:14,042 INFO L752 eck$LassoCheckResult]: Stem: "[56] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[82] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[62] L22-->L26: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[64] L26-->L27: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[66] L27-->L28-1: Formula: (<= 2 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 16:24:14,042 INFO L754 eck$LassoCheckResult]: Loop: "[68] L28-1-->L30: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[70] L30-->L28-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:24:14,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash 82850821, now seen corresponding path program 1 times [2025-04-26 16:24:14,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:14,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706114196] [2025-04-26 16:24:14,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:14,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:14,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:14,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:14,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:14,088 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:24:14,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:14,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706114196] [2025-04-26 16:24:14,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706114196] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:14,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:14,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:24:14,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210368463] [2025-04-26 16:24:14,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:14,091 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:24:14,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,092 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2025-04-26 16:24:14,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:14,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788074372] [2025-04-26 16:24:14,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:14,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:14,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:14,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:14,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,096 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:14,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:14,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:14,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:14,112 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:14,112 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:14,112 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:14,112 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:14,112 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:14,112 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,112 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:14,112 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:14,112 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb3_b.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:14,112 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:14,112 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:14,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:14,129 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:14,129 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:14,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,134 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:14,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:24:14,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:14,136 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:14,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:24:14,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,187 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:24:14,188 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:24:14,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:14,189 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:14,255 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:14,260 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:24:14,260 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:14,260 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:14,260 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:14,261 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:14,261 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:14,261 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,261 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:14,261 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:14,261 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb3_b.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:14,261 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:14,261 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:14,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:14,292 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:14,292 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:14,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,295 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:24:14,296 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:24:14,297 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:24:14,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:14,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:14,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:14,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:14,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:14,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:14,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:14,310 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:14,313 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:14,313 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:14,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,315 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:24:14,316 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:24:14,317 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:14,320 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:14,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:14,321 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:14,321 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:14,321 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:24:14,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:24:14,329 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:14,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:14,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:14,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:14,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:14,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:14,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:14,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:14,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:14,377 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:14,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:14,393 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:24:14,394 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:24:14,394 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 173 states and 435 transitions. cyclomatic complexity: 296 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:14,443 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 173 states and 435 transitions. cyclomatic complexity: 296. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 387 states and 1017 transitions. Complement of second has 7 states. [2025-04-26 16:24:14,443 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:24:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-04-26 16:24:14,444 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:14,444 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:14,444 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:24:14,445 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:14,445 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:24:14,445 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:14,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 1017 transitions. [2025-04-26 16:24:14,448 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 16:24:14,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 249 states and 617 transitions. [2025-04-26 16:24:14,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2025-04-26 16:24:14,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2025-04-26 16:24:14,451 INFO L74 IsDeterministic]: Start isDeterministic. Operand 249 states and 617 transitions. [2025-04-26 16:24:14,451 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:14,452 INFO L218 hiAutomatonCegarLoop]: Abstraction has 249 states and 617 transitions. [2025-04-26 16:24:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 617 transitions. [2025-04-26 16:24:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 174. [2025-04-26 16:24:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 2.4827586206896552) internal successors, (in total 432), 173 states have internal predecessors, (432), 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:24:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 432 transitions. [2025-04-26 16:24:14,464 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 432 transitions. [2025-04-26 16:24:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:14,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:24:14,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:24:14,468 INFO L87 Difference]: Start difference. First operand 174 states and 432 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:14,490 INFO L93 Difference]: Finished difference Result 98 states and 230 transitions. [2025-04-26 16:24:14,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 230 transitions. [2025-04-26 16:24:14,491 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-04-26 16:24:14,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 88 states and 204 transitions. [2025-04-26 16:24:14,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-04-26 16:24:14,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-04-26 16:24:14,492 INFO L74 IsDeterministic]: Start isDeterministic. Operand 88 states and 204 transitions. [2025-04-26 16:24:14,492 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:14,492 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 204 transitions. [2025-04-26 16:24:14,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 204 transitions. [2025-04-26 16:24:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-04-26 16:24:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 2.3181818181818183) internal successors, (in total 204), 87 states have internal predecessors, (204), 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:24:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 204 transitions. [2025-04-26 16:24:14,495 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88 states and 204 transitions. [2025-04-26 16:24:14,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:24:14,496 INFO L438 stractBuchiCegarLoop]: Abstraction has 88 states and 204 transitions. [2025-04-26 16:24:14,496 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:14,496 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 204 transitions. [2025-04-26 16:24:14,497 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-04-26 16:24:14,497 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:14,497 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:14,497 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:14,497 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:14,497 INFO L752 eck$LassoCheckResult]: Stem: "[56] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[82] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[85] L13-1-->L37: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[71] L37-->L41: Formula: (<= v_z_6 v_x3_8) InVars {x3=v_x3_8, z=v_z_6} OutVars{x3=v_x3_8, z=v_z_6} AuxVars[] AssignedVars[]" "[73] L41-->L42: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[62] L22-->L26: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[64] L26-->L27: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[75] L42-->L43-1: Formula: (<= 2 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-04-26 16:24:14,497 INFO L754 eck$LassoCheckResult]: Loop: "[77] L43-1-->L45: Formula: (< v_x1_5 v_z_7) InVars {x1=v_x1_5, z=v_z_7} OutVars{x1=v_x1_5, z=v_z_7} AuxVars[] AssignedVars[]" "[79] L45-->L43-1: Formula: (= v_x4_1 (+ v_x4_2 1)) InVars {x4=v_x4_2} OutVars{x4=v_x4_1} AuxVars[] AssignedVars[x4]" [2025-04-26 16:24:14,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,498 INFO L85 PathProgramCache]: Analyzing trace with hash -732181491, now seen corresponding path program 1 times [2025-04-26 16:24:14,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:14,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825445285] [2025-04-26 16:24:14,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:14,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:14,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:14,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:14,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:14,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:14,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:14,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:14,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2025-04-26 16:24:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:14,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706708061] [2025-04-26 16:24:14,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:14,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:14,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:14,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:14,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:14,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:14,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:14,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:14,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash 748226159, now seen corresponding path program 1 times [2025-04-26 16:24:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:14,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204852189] [2025-04-26 16:24:14,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:14,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:14,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:24:14,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:24:14,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:14,525 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:24:14,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:14,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204852189] [2025-04-26 16:24:14,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204852189] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:14,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:14,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:24:14,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188292320] [2025-04-26 16:24:14,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:14,535 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:14,536 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:14,536 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:14,536 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:14,536 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:14,536 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,536 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:14,536 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:14,536 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb3_b.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:14,536 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:14,536 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:14,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:14,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:14,552 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:14,552 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:14,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,554 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:24:14,555 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:24:14,557 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:14,557 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:14,572 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:24:14,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,575 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:14,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:24:14,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:14,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:14,600 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:14,600 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x4=0} Honda state: {x4=0} Generalized eigenvectors: [{x4=2}, {x4=-6}, {x4=5}] Lambdas: [4, 1, 1] Nus: [1, 0] [2025-04-26 16:24:14,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:24:14,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,608 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:14,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:24:14,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:14,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:14,627 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:14,627 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x1=0, z=1} Honda state: {x1=0, z=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:14,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:24:14,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:14,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:24:14,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:24:14,635 INFO L87 Difference]: Start difference. First operand 88 states and 204 transitions. cyclomatic complexity: 135 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:24:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:14,650 INFO L93 Difference]: Finished difference Result 78 states and 171 transitions. [2025-04-26 16:24:14,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 171 transitions. [2025-04-26 16:24:14,651 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:14,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2025-04-26 16:24:14,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:14,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:14,651 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:14,651 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:14,652 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:14,652 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:14,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:24:14,652 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:14,652 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:24:14,652 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:14,652 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:14,652 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:14,657 INFO L201 PluginConnector]: Adding new model bb3_b.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:14 BoogieIcfgContainer [2025-04-26 16:24:14,658 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:14,658 INFO L158 Benchmark]: Toolchain (without parser) took 2149.65ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 95.8MB in the beginning and 32.1MB in the end (delta: 63.7MB). Peak memory consumption was 38.1MB. Max. memory is 8.0GB. [2025-04-26 16:24:14,658 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:14,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.81ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 93.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:14,658 INFO L158 Benchmark]: Boogie Preprocessor took 15.79ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 92.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:14,659 INFO L158 Benchmark]: RCFGBuilder took 179.25ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 83.8MB in the end (delta: 9.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:24:14,659 INFO L158 Benchmark]: BuchiAutomizer took 1914.40ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 83.5MB in the beginning and 32.1MB in the end (delta: 51.4MB). Peak memory consumption was 29.7MB. Max. memory is 8.0GB. [2025-04-26 16:24:14,660 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.19ms. Allocated memory is still 167.8MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.81ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 93.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 15.79ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 92.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 179.25ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 83.8MB in the end (delta: 9.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 1914.40ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 83.5MB in the beginning and 32.1MB in the end (delta: 51.4MB). Peak memory consumption was 29.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 151 StatesRemovedByMinimization, 3 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, 138 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 96 mSDtfsCounter, 164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc1 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp92 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf95 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 43ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:14,670 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...