/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/bb4.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:12,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:12,415 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,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:12,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:12,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:12,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:12,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:12,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:12,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:12,443 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:12,443 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:12,443 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:12,443 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:12,443 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:12,443 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:12,443 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:12,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:12,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:12,443 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:12,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:12,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:12,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:12,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:12,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:12,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:12,444 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:12,444 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:12,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:12,444 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:12,444 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:12,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:12,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:12,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:12,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:12,444 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:12,444 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:12,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:12,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:12,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:12,667 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:12,667 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:12,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/bb4.c.bpl [2025-04-26 16:24:12,671 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/bb4.c.bpl' [2025-04-26 16:24:12,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:12,686 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:12,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:12,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:12,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:12,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,721 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:12,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:12,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:12,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:12,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:12,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:12,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:12,753 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:12,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:12,754 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/1) ... [2025-04-26 16:24:12,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:12,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:12,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:12,789 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,812 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:12,813 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:12,813 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:12,813 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:12,813 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:12,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:12,814 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,847 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:12,849 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:12,910 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:12,910 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:12,918 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:12,918 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:12,918 INFO L201 PluginConnector]: Adding new model bb4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:12 BoogieIcfgContainer [2025-04-26 16:24:12,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:12,919 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:12,919 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:12,923 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:12,924 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:12,924 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:12" (1/2) ... [2025-04-26 16:24:12,925 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7dc306ed and model type bb4.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,925 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:12,925 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:12" (2/2) ... [2025-04-26 16:24:12,926 INFO L376 chiAutomizerObserver]: Analyzing ICFG bb4.c.bpl [2025-04-26 16:24:12,959 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:24:12,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 24 transitions, 62 flow [2025-04-26 16:24:13,001 INFO L116 PetriNetUnfolderBase]: 4/20 cut-off events. [2025-04-26 16:24:13,003 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:24:13,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 4/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 30 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-26 16:24:13,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 24 transitions, 62 flow [2025-04-26 16:24:13,008 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 20 transitions, 52 flow [2025-04-26 16:24:13,009 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 23 places, 20 transitions, 52 flow [2025-04-26 16:24:13,017 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:13,018 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:13,018 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:13,018 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:13,018 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:13,018 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:13,018 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:13,018 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:13,019 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:13,054 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 40 [2025-04-26 16:24:13,054 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:13,054 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:13,059 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:13,059 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:13,059 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:13,059 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 51 states, but on-demand construction may add more states [2025-04-26 16:24:13,064 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 40 [2025-04-26 16:24:13,064 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:13,064 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:13,064 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:13,064 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:13,070 INFO L752 eck$LassoCheckResult]: Stem: "[50] $Ultimate##0-->L13: Formula: (= v_x2_1 0) InVars {} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[70] 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:13,070 INFO L754 eck$LassoCheckResult]: Loop: "[55] 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[]" "[58] 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:13,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:13,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2581, now seen corresponding path program 1 times [2025-04-26 16:24:13,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:13,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938790095] [2025-04-26 16:24:13,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:13,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:13,142 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,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:13,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:13,149 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,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:13,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2724, now seen corresponding path program 1 times [2025-04-26 16:24:13,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:13,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180094445] [2025-04-26 16:24:13,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:13,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:13,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:13,171 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,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:13,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:13,178 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,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:13,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:13,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2482104, now seen corresponding path program 1 times [2025-04-26 16:24:13,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:13,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426064187] [2025-04-26 16:24:13,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:13,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:13,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:13,190 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,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,191 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:13,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:13,197 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,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:13,255 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:13,255 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:13,255 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:13,255 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:13,256 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:13,256 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,256 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:13,256 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:13,256 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:13,256 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:13,256 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:13,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:13,305 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:13,305 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:13,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,308 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,310 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,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:13,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:13,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:24:13,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,331 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,333 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,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:13,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:13,408 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:13,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:24:13,412 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:13,413 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:13,413 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:13,413 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:13,413 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:13,413 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,413 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:13,413 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:13,413 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:13,413 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:13,413 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:13,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:13,439 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:13,441 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:13,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,444 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,446 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,447 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,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:13,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:13,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:13,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:13,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:13,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:13,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:13,469 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:13,480 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:13,480 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:13,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,484 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,486 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,487 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:13,490 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:13,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:13,491 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:13,492 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:13,492 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:24:13,498 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,501 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:13,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:13,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:13,529 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,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:13,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:13,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:13,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:13,542 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,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:13,543 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:13,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:13,559 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,587 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:13,611 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 51 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,740 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 51 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 186 states and 433 transitions. Complement of second has 7 states. [2025-04-26 16:24:13,741 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,744 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,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-04-26 16:24:13,757 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:13,758 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:13,758 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:13,758 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:13,758 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:13,758 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:13,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 433 transitions. [2025-04-26 16:24:13,768 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 26 [2025-04-26 16:24:13,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 92 states and 224 transitions. [2025-04-26 16:24:13,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-04-26 16:24:13,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-04-26 16:24:13,776 INFO L74 IsDeterministic]: Start isDeterministic. Operand 92 states and 224 transitions. [2025-04-26 16:24:13,776 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:13,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 224 transitions. [2025-04-26 16:24:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 224 transitions. [2025-04-26 16:24:13,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2025-04-26 16:24:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 2.5) internal successors, (in total 185), 73 states have internal predecessors, (185), 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,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 185 transitions. [2025-04-26 16:24:13,817 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 185 transitions. [2025-04-26 16:24:13,817 INFO L438 stractBuchiCegarLoop]: Abstraction has 74 states and 185 transitions. [2025-04-26 16:24:13,817 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:13,817 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 185 transitions. [2025-04-26 16:24:13,818 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 26 [2025-04-26 16:24:13,818 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:13,818 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:13,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:13,819 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:13,819 INFO L752 eck$LassoCheckResult]: Stem: "[50] $Ultimate##0-->L13: Formula: (= v_x2_1 0) InVars {} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[70] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[54] L22-->L26-1: 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[]" [2025-04-26 16:24:13,819 INFO L754 eck$LassoCheckResult]: Loop: "[57] L26-1-->L28: 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[]" "[60] L28-->L26-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:13,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:13,820 INFO L85 PathProgramCache]: Analyzing trace with hash 80065, now seen corresponding path program 1 times [2025-04-26 16:24:13,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:13,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236482175] [2025-04-26 16:24:13,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:13,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:13,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:13,823 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,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,823 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:13,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:13,824 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,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:13,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:13,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2788, now seen corresponding path program 1 times [2025-04-26 16:24:13,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:13,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713289211] [2025-04-26 16:24:13,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:13,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:13,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:13,828 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,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,828 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:13,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:13,830 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,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:13,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:13,831 INFO L85 PathProgramCache]: Analyzing trace with hash 76944292, now seen corresponding path program 1 times [2025-04-26 16:24:13,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:13,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307024076] [2025-04-26 16:24:13,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:13,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:13,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:13,835 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,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:13,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:13,837 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,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:13,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:13,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:13,861 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:13,861 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:13,861 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:13,861 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:13,861 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:13,861 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,861 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:13,861 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:13,861 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:13,861 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:13,861 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:13,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:13,885 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:13,885 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:13,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,889 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,890 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,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:13,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:13,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:13,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,912 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,914 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,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:13,916 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:13,984 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:13,988 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,989 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:13,989 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:13,989 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:13,989 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:13,989 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:13,989 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,989 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:13,989 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:13,989 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:13,989 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:13,989 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:13,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:14,010 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:14,010 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:14,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,012 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:14,013 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:14,014 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,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:14,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:14,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:14,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:14,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:14,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:14,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:14,029 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:14,031 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:14,031 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:14,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,033 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:14,035 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:14,036 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:14,038 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:14,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:24:14,039 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:14,039 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:14,039 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:24:14,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:24:14,046 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:14,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:14,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:14,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:14,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:14,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:14,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:14,069 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,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:14,070 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:14,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:14,083 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,084 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,084 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 185 transitions. cyclomatic complexity: 132 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,147 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 185 transitions. cyclomatic complexity: 132. 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 201 states and 477 transitions. Complement of second has 7 states. [2025-04-26 16:24:14,147 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,148 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,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-04-26 16:24:14,148 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:14,148 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:14,148 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,148 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:14,148 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:24:14,148 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:14,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 477 transitions. [2025-04-26 16:24:14,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 16:24:14,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 16 states and 35 transitions. [2025-04-26 16:24:14,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-04-26 16:24:14,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-04-26 16:24:14,152 INFO L74 IsDeterministic]: Start isDeterministic. Operand 16 states and 35 transitions. [2025-04-26 16:24:14,152 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:14,152 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 35 transitions. [2025-04-26 16:24:14,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 35 transitions. [2025-04-26 16:24:14,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-04-26 16:24:14,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.1875) internal successors, (in total 35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2025-04-26 16:24:14,153 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 35 transitions. [2025-04-26 16:24:14,153 INFO L438 stractBuchiCegarLoop]: Abstraction has 16 states and 35 transitions. [2025-04-26 16:24:14,153 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:14,153 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 35 transitions. [2025-04-26 16:24:14,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 16:24:14,154 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:14,154 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:14,154 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:14,154 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:14,154 INFO L752 eck$LassoCheckResult]: Stem: "[50] $Ultimate##0-->L13: Formula: (= v_x2_1 0) InVars {} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[70] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[73] L13-1-->L35: 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:14,154 INFO L754 eck$LassoCheckResult]: Loop: "[62] L35-->L37: 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[]" "[65] L37-->L35: 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:14,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,155 INFO L85 PathProgramCache]: Analyzing trace with hash 80084, now seen corresponding path program 1 times [2025-04-26 16:24:14,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:14,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906134690] [2025-04-26 16:24:14,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:14,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:14,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:14,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:14,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,158 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:14,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:14,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:14,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:14,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2948, now seen corresponding path program 1 times [2025-04-26 16:24:14,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:14,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572146189] [2025-04-26 16:24:14,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:14,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:14,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:14,163 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,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:14,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:14,165 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,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:14,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,166 INFO L85 PathProgramCache]: Analyzing trace with hash 76962711, now seen corresponding path program 1 times [2025-04-26 16:24:14,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:14,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172388621] [2025-04-26 16:24:14,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:14,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:14,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:14,174 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,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,174 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:14,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:14,178 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,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:14,194 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:14,195 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:14,195 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:14,195 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:14,195 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:14,195 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,195 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:14,195 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:14,195 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:14,195 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:14,195 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:14,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:14,213 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:14,213 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:14,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,216 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,217 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,219 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:14,219 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:14,237 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,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,239 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,240 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,242 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:14,242 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:14,308 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:14,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:14,312 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:14,312 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:14,312 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:14,312 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:14,312 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:14,312 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,312 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:14,312 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:14,313 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:14,313 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:14,313 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:14,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:14,330 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:14,330 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:14,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,333 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,334 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,335 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,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:14,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:14,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:14,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:14,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:14,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:14,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:14,349 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:14,352 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:14,352 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:14,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,353 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,354 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,355 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:14,358 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,358 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:14,358 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:14,358 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:24:14,364 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,365 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:14,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:14,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:14,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:14,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:14,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:14,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:14,393 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,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:14,394 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:14,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:14,411 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,411 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,411 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 35 transitions. cyclomatic complexity: 23 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,430 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 35 transitions. cyclomatic complexity: 23. 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 34 states and 69 transitions. Complement of second has 6 states. [2025-04-26 16:24:14,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:14,431 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,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-04-26 16:24:14,431 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:14,432 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:14,432 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:14,432 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:14,432 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:24:14,432 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:14,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 69 transitions. [2025-04-26 16:24:14,432 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:14,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2025-04-26 16:24:14,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:14,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:14,433 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:14,433 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:14,433 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:14,433 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:14,433 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:14,433 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:14,433 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:14,433 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:14,433 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:14,439 INFO L201 PluginConnector]: Adding new model bb4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:14 BoogieIcfgContainer [2025-04-26 16:24:14,439 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:14,440 INFO L158 Benchmark]: Toolchain (without parser) took 1753.99ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 87.6MB in the beginning and 64.6MB in the end (delta: 23.0MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2025-04-26 16:24:14,440 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.00ms. Allocated memory is still 159.4MB. Free memory was 88.6MB in the beginning and 88.4MB in the end (delta: 199.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:14,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.47ms. Allocated memory is still 159.4MB. Free memory was 87.6MB in the beginning and 85.3MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:24:14,440 INFO L158 Benchmark]: Boogie Preprocessor took 27.11ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 84.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:14,440 INFO L158 Benchmark]: RCFGBuilder took 165.95ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 75.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:14,441 INFO L158 Benchmark]: BuchiAutomizer took 1519.81ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.3MB in the beginning and 64.6MB in the end (delta: 10.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:14,442 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 1.00ms. Allocated memory is still 159.4MB. Free memory was 88.6MB in the beginning and 88.4MB in the end (delta: 199.2kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.47ms. Allocated memory is still 159.4MB. Free memory was 87.6MB in the beginning and 85.3MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.11ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 84.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 165.95ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 75.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1519.81ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.3MB in the beginning and 64.6MB in the end (delta: 10.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 18 StatesRemovedByMinimization, 1 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, 65 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 106 IncrementalHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 32 mSDtfsCounter, 106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 49ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 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 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,455 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...