/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/b4.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:09,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:09,116 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:09,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:09,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:09,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:09,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:09,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:09,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:09,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:09,143 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:09,143 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:09,144 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:09,144 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:09,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:09,145 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:09,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:09,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:09,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:09,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:09,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:09,146 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:09,146 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:09,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:09,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:09,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:09,365 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:09,366 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:09,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/b4.c.bpl [2025-04-26 16:24:09,369 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/b4.c.bpl' [2025-04-26 16:24:09,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:09,383 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:09,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:09,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:09,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:09,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,413 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:09,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:09,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:09,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:09,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:09,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,425 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:09,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:09,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:09,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:09,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:09,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:09,463 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:09,468 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:09,483 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:09,484 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:09,485 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:09,486 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:09,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:09,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:09,486 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:09,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:09,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:09,486 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:09,524 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:09,526 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:09,578 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:09,578 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:09,586 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:09,586 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:09,588 INFO L201 PluginConnector]: Adding new model b4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:09 BoogieIcfgContainer [2025-04-26 16:24:09,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:09,589 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:09,589 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:09,594 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:09,595 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:09,595 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/2) ... [2025-04-26 16:24:09,596 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c1abeab and model type b4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:09, skipping insertion in model container [2025-04-26 16:24:09,597 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:09,597 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "b4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:09" (2/2) ... [2025-04-26 16:24:09,598 INFO L376 chiAutomizerObserver]: Analyzing ICFG b4.c.bpl [2025-04-26 16:24:09,644 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:24:09,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 52 flow [2025-04-26 16:24:09,697 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-26 16:24:09,698 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:24:09,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 15 events. 2/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 22 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-04-26 16:24:09,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 19 transitions, 52 flow [2025-04-26 16:24:09,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 15 transitions, 42 flow [2025-04-26 16:24:09,706 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 20 places, 15 transitions, 42 flow [2025-04-26 16:24:09,714 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:09,714 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:09,715 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:09,715 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:09,715 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:09,715 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:09,715 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:09,715 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:09,717 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:09,744 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 26 [2025-04-26 16:24:09,745 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:09,745 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:09,748 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:24:09,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:24:09,749 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:09,749 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 36 states, but on-demand construction may add more states [2025-04-26 16:24:09,752 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 26 [2025-04-26 16:24:09,752 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:09,752 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:09,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:24:09,752 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:24:09,756 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:09,756 INFO L754 eck$LassoCheckResult]: Loop: "[37] L21-->L23: Formula: (< (+ v_x4_1 v_x3_1 v_x1_1) v_z_1) InVars {x1=v_x1_1, x4=v_x4_1, x3=v_x3_1, z=v_z_1} OutVars{x1=v_x1_1, x4=v_x4_1, x3=v_x3_1, z=v_z_1} AuxVars[] AssignedVars[]" "[39] L23-->L24: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[40] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[41] L25-->L21: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:24:09,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:09,761 INFO L85 PathProgramCache]: Analyzing trace with hash 79, now seen corresponding path program 1 times [2025-04-26 16:24:09,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:09,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659097083] [2025-04-26 16:24:09,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:09,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:09,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:09,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:09,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:09,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:09,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:09,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:09,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:09,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:09,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:09,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:09,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:09,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2064548, now seen corresponding path program 1 times [2025-04-26 16:24:09,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:09,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287654872] [2025-04-26 16:24:09,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:09,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:09,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:09,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:09,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:09,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:09,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:09,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:09,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:09,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:09,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:09,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:09,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash 74099186, now seen corresponding path program 1 times [2025-04-26 16:24:09,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:09,872 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105175083] [2025-04-26 16:24:09,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:09,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:09,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:09,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:09,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:09,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:09,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:09,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:09,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:09,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:09,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:09,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:09,975 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:09,976 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:09,976 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:09,976 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:09,976 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:09,977 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:09,977 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:09,977 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:09,977 INFO L132 ssoRankerPreferences]: Filename of dumped script: b4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:09,977 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:09,977 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:09,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:10,056 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:10,058 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:10,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,061 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:10,062 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:10,064 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:10,064 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:10,089 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:10,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,092 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:10,093 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:10,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:10,096 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:10,233 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:10,239 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:10,239 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:10,239 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:10,239 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:10,240 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:10,240 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:10,240 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,240 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:10,240 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:10,240 INFO L132 ssoRankerPreferences]: Filename of dumped script: b4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:10,240 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:10,240 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:10,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:10,276 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:10,278 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:10,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,281 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:10,283 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:10,285 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:10,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:10,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:10,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:10,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:10,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:10,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:10,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:10,309 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:10,317 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:24:10,318 INFO L437 ModelExtractionUtils]: 0 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:10,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,321 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:10,323 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:10,324 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:10,327 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:10,328 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:10,328 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:10,328 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, x1, z, x4) = -1*x3 - 1*x1 + 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:24:10,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:10,340 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:10,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:10,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:10,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:10,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:10,374 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:10,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:10,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:10,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:10,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:10,388 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:24:10,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:10,487 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:10,521 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:24:10,523 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 36 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 1.0) internal successors, (in total 5), 4 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:10,627 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 36 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 1.0) internal successors, (in total 5), 4 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 88 states and 181 transitions. Complement of second has 6 states. [2025-04-26 16:24:10,629 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:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.0) internal successors, (in total 5), 4 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:10,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-04-26 16:24:10,639 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:24:10,640 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:10,640 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:24:10,640 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:10,640 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 1 letters. Loop has 8 letters. [2025-04-26 16:24:10,640 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:10,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 181 transitions. [2025-04-26 16:24:10,644 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:24:10,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 42 states and 89 transitions. [2025-04-26 16:24:10,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-04-26 16:24:10,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-04-26 16:24:10,648 INFO L74 IsDeterministic]: Start isDeterministic. Operand 42 states and 89 transitions. [2025-04-26 16:24:10,648 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:10,649 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 89 transitions. [2025-04-26 16:24:10,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 89 transitions. [2025-04-26 16:24:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2025-04-26 16:24:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.142857142857143) internal successors, (in total 75), 34 states have internal predecessors, (75), 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:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 75 transitions. [2025-04-26 16:24:10,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 75 transitions. [2025-04-26 16:24:10,669 INFO L438 stractBuchiCegarLoop]: Abstraction has 35 states and 75 transitions. [2025-04-26 16:24:10,669 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:10,669 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 75 transitions. [2025-04-26 16:24:10,672 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:24:10,672 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:10,672 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:10,672 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:10,672 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:10,674 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[51] L12-->L32: 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:10,674 INFO L754 eck$LassoCheckResult]: Loop: "[43] L32-->L34: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[45] L34-->L32: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:24:10,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2500, now seen corresponding path program 1 times [2025-04-26 16:24:10,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:10,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438260272] [2025-04-26 16:24:10,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:10,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:10,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:10,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:10,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,681 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:10,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:10,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:10,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:10,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:10,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2339, now seen corresponding path program 1 times [2025-04-26 16:24:10,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:10,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280427174] [2025-04-26 16:24:10,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:10,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:10,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:10,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:10,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:10,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:10,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:10,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:10,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:10,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2403878, now seen corresponding path program 1 times [2025-04-26 16:24:10,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:10,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728768131] [2025-04-26 16:24:10,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:10,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:10,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:10,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:10,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:10,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:10,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:10,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:10,733 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:10,734 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:10,734 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:10,734 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:10,734 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:10,734 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,734 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:10,734 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:10,734 INFO L132 ssoRankerPreferences]: Filename of dumped script: b4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:10,734 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:10,734 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:10,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:10,750 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:10,750 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:10,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,753 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:10,754 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:10,756 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:10,756 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:10,778 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:10,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,781 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:10,781 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:10,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:10,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:10,851 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:10,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:24:10,856 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:10,856 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:10,856 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:10,856 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:10,856 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:10,856 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,856 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:10,856 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:10,857 INFO L132 ssoRankerPreferences]: Filename of dumped script: b4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:10,857 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:10,857 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:10,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:10,879 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:10,879 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:10,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,901 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:10,961 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:10,961 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:10,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:10,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:10,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:10,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:10,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:10,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:10,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:10,976 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:10,980 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:10,980 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:10,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,983 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:10,984 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:10,985 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:10,988 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:10,989 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:10,989 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:10,989 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:10,989 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:24:10,995 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:10,996 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:11,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:11,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:11,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:11,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:11,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:11,025 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:11,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:11,039 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:11,040 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:11,040 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 75 transitions. cyclomatic complexity: 49 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:11,081 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 75 transitions. cyclomatic complexity: 49. 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 88 states and 193 transitions. Complement of second has 6 states. [2025-04-26 16:24:11,082 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:11,082 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:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-04-26 16:24:11,085 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:11,085 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:11,085 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:11,085 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:11,085 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:11,085 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:11,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 193 transitions. [2025-04-26 16:24:11,088 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:11,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 0 states and 0 transitions. [2025-04-26 16:24:11,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:11,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:11,088 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:11,088 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:11,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:11,088 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:11,088 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:11,088 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:11,089 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:11,089 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:11,089 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:11,096 INFO L201 PluginConnector]: Adding new model b4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:11 BoogieIcfgContainer [2025-04-26 16:24:11,096 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:11,097 INFO L158 Benchmark]: Toolchain (without parser) took 1713.92ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 87.0MB in the beginning and 66.9MB in the end (delta: 20.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:11,098 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.64ms. Allocated memory is still 159.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:11,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.30ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 85.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:11,099 INFO L158 Benchmark]: Boogie Preprocessor took 22.06ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 84.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:11,099 INFO L158 Benchmark]: RCFGBuilder took 150.39ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 75.4MB in the end (delta: 8.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:24:11,100 INFO L158 Benchmark]: BuchiAutomizer took 1507.77ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 75.3MB in the beginning and 66.9MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:11,101 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.64ms. Allocated memory is still 159.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.30ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 85.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.06ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 84.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 150.39ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 75.4MB in the end (delta: 8.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1507.77ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 75.3MB in the beginning and 66.9MB in the end (delta: 8.4MB). 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 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. 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 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 7 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 20 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq162 hnf93 smp100 dnf100 smp100 tf108 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 49ms VariablesStem: 0 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + -1 * x1 + -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 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:11,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...