/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/b1.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:45:19,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:45:19,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:45:19,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:45:19,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:45:19,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:45:19,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:45:19,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:45:19,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:45:19,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:45:19,961 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:45:19,962 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:45:19,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:45:19,962 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:45:19,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:45:19,963 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:45:19,963 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:45:19,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:45:19,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:45:19,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:45:19,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:45:19,963 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:45:19,963 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-02-17 22:45:20,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:45:20,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:45:20,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:45:20,190 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:45:20,191 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:45:20,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/b1.c.bpl [2025-02-17 22:45:20,192 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/b1.c.bpl' [2025-02-17 22:45:20,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:45:20,206 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:45:20,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:20,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:45:20,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:45:20,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "b1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "b1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,222 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:45:20,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:20,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:45:20,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:45:20,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:45:20,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "b1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "b1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "b1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "b1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,229 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "b1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "b1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "b1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "b1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "b1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:45:20,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:45:20,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:45:20,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:45:20,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "b1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/1) ... [2025-02-17 22:45:20,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:20,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:20,269 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-02-17 22:45:20,272 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-02-17 22:45:20,294 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:45:20,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:45:20,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:45:20,295 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:45:20,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:45:20,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:45:20,295 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:45:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:45:20,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:45:20,296 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:45:20,336 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:45:20,339 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:45:20,389 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:45:20,389 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:45:20,397 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:45:20,397 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:45:20,398 INFO L201 PluginConnector]: Adding new model b1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:20 BoogieIcfgContainer [2025-02-17 22:45:20,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:45:20,400 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:45:20,400 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:45:20,404 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:45:20,405 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:20,405 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "b1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:20" (1/2) ... [2025-02-17 22:45:20,406 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4874d329 and model type b1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:45:20, skipping insertion in model container [2025-02-17 22:45:20,407 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:20,407 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "b1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:20" (2/2) ... [2025-02-17 22:45:20,408 INFO L363 chiAutomizerObserver]: Analyzing ICFG b1.c.bpl [2025-02-17 22:45:20,456 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:45:20,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 17 transitions, 48 flow [2025-02-17 22:45:20,505 INFO L124 PetriNetUnfolderBase]: 2/13 cut-off events. [2025-02-17 22:45:20,506 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:45:20,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 13 events. 2/13 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-02-17 22:45:20,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 17 transitions, 48 flow [2025-02-17 22:45:20,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 18 places, 13 transitions, 38 flow [2025-02-17 22:45:20,522 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:45:20,522 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:45:20,522 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:45:20,522 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:45:20,522 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:45:20,522 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:45:20,522 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:45:20,522 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:45:20,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-02-17 22:45:20,543 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-02-17 22:45:20,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:20,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:20,546 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:45:20,546 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:20,547 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:45:20,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 26 states, but on-demand construction may add more states [2025-02-17 22:45:20,548 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-02-17 22:45:20,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:20,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:20,548 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:45:20,548 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:20,552 INFO L752 eck$LassoCheckResult]: Stem: "[42] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:45:20,552 INFO L754 eck$LassoCheckResult]: Loop: "[33] L21-->L23: 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[]" "[35] L23-->L21: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-02-17 22:45:20,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 1 times [2025-02-17 22:45:20,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:20,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129368978] [2025-02-17 22:45:20,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:20,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:20,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:20,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:20,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:20,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:20,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:20,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:20,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:20,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2025-02-17 22:45:20,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:20,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192302268] [2025-02-17 22:45:20,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:20,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:20,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:20,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:20,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,630 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:20,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:20,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:20,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:20,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash 71211, now seen corresponding path program 1 times [2025-02-17 22:45:20,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:20,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651667423] [2025-02-17 22:45:20,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:20,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:20,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:20,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:20,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,641 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:20,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:20,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:20,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:20,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:20,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:20,705 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:20,706 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:20,706 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:20,706 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:20,706 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:20,706 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:20,706 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:20,706 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:20,706 INFO L132 ssoRankerPreferences]: Filename of dumped script: b1.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:20,706 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:20,706 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:20,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:20,771 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:20,772 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:20,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:20,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:20,775 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-02-17 22:45:20,777 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-02-17 22:45:20,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:20,778 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:20,800 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-02-17 22:45:20,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:20,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:20,804 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-02-17 22:45:20,804 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-02-17 22:45:20,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:20,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:20,888 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:20,893 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-02-17 22:45:20,893 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:20,893 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:20,893 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:20,893 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:20,894 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:20,894 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:20,894 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:20,894 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:20,894 INFO L132 ssoRankerPreferences]: Filename of dumped script: b1.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:20,894 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:20,894 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:20,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:20,928 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:20,931 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:20,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:20,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:20,934 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-02-17 22:45:20,936 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-02-17 22:45:20,937 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-02-17 22:45:20,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:20,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:20,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:20,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:20,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:20,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:20,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:20,956 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:20,961 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:20,961 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:20,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:20,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:20,964 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-02-17 22:45:20,967 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-02-17 22:45:20,968 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:20,968 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:20,969 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:20,969 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-02-17 22:45:20,978 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-02-17 22:45:20,980 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:21,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:21,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:21,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:21,015 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:21,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:21,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:21,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:21,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:21,026 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:21,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:21,072 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-02-17 22:45:21,075 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 26 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:21,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:45:21,165 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 26 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 69 states and 150 transitions. Complement of second has 6 states. [2025-02-17 22:45:21,166 INFO L141 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-02-17 22:45:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2025-02-17 22:45:21,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 1 letters. Loop has 2 letters. [2025-02-17 22:45:21,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:45:21,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-17 22:45:21,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 150 transitions. [2025-02-17 22:45:21,193 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-02-17 22:45:21,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 29 states and 65 transitions. [2025-02-17 22:45:21,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-02-17 22:45:21,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-17 22:45:21,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 65 transitions. [2025-02-17 22:45:21,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:21,197 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 65 transitions. [2025-02-17 22:45:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 65 transitions. [2025-02-17 22:45:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2025-02-17 22:45:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 53 transitions. [2025-02-17 22:45:21,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 53 transitions. [2025-02-17 22:45:21,236 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 53 transitions. [2025-02-17 22:45:21,236 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:45:21,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 53 transitions. [2025-02-17 22:45:21,239 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-02-17 22:45:21,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:21,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:21,240 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:45:21,240 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:21,240 INFO L752 eck$LassoCheckResult]: Stem: "[42] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[45] L12-->L30: 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-02-17 22:45:21,240 INFO L754 eck$LassoCheckResult]: Loop: "[37] L30-->L32: 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[]" "[39] L32-->L30: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:45:21,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2025-02-17 22:45:21,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:21,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621675873] [2025-02-17 22:45:21,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:21,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:21,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:21,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:21,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:21,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:21,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:21,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:21,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2025-02-17 22:45:21,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:21,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580535465] [2025-02-17 22:45:21,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:21,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:21,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:21,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:21,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,261 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:21,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:21,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:21,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:21,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2219174, now seen corresponding path program 1 times [2025-02-17 22:45:21,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:21,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825129713] [2025-02-17 22:45:21,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:21,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:21,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:21,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:21,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,267 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:21,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:21,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:21,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:21,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:21,289 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:21,289 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:21,289 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:21,289 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:21,289 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:21,289 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,289 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:21,289 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:21,289 INFO L132 ssoRankerPreferences]: Filename of dumped script: b1.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:21,289 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:21,289 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:21,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:21,307 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:21,307 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:21,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,309 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-02-17 22:45:21,310 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-02-17 22:45:21,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:21,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:21,328 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-02-17 22:45:21,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,330 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-02-17 22:45:21,331 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-02-17 22:45:21,332 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:21,332 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:21,395 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:21,400 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-02-17 22:45:21,400 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:21,400 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:21,400 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:21,400 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:21,400 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:21,401 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,401 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:21,401 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:21,401 INFO L132 ssoRankerPreferences]: Filename of dumped script: b1.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:21,402 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:21,404 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:21,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:21,425 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:21,426 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:21,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,429 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-02-17 22:45:21,430 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-02-17 22:45:21,431 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-02-17 22:45:21,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:21,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:21,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:21,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:21,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:21,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:21,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:21,447 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:21,452 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:21,452 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:21,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:21,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:21,456 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-02-17 22:45:21,457 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-02-17 22:45:21,458 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:21,458 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:21,458 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:21,458 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-02-17 22:45:21,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:21,464 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:21,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:21,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:21,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:21,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:21,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:21,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:21,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:21,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:21,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:21,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:21,497 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:21,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:21,516 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-02-17 22:45:21,518 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 53 transitions. cyclomatic complexity: 37 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:21,553 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 53 transitions. cyclomatic complexity: 37. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 131 transitions. Complement of second has 6 states. [2025-02-17 22:45:21,554 INFO L141 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-02-17 22:45:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:21,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2025-02-17 22:45:21,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:45:21,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:45:21,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:45:21,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:21,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 131 transitions. [2025-02-17 22:45:21,557 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:21,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 0 states and 0 transitions. [2025-02-17 22:45:21,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:45:21,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:45:21,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:45:21,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:45:21,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:21,557 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:21,557 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:21,557 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:45:21,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:45:21,557 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:21,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:45:21,564 INFO L201 PluginConnector]: Adding new model b1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:45:21 BoogieIcfgContainer [2025-02-17 22:45:21,564 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:45:21,564 INFO L158 Benchmark]: Toolchain (without parser) took 1358.46ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 103.6MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:21,564 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:21,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.16ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 92.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:21,565 INFO L158 Benchmark]: Boogie Preprocessor took 12.40ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 91.6MB in the end (delta: 674.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:21,565 INFO L158 Benchmark]: RCFGBuilder took 162.24ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 83.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:45:21,565 INFO L158 Benchmark]: BuchiAutomizer took 1163.98ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 103.6MB in the end (delta: -20.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:21,566 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.18ms. Allocated memory is still 167.8MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 16.16ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 92.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 12.40ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 91.6MB in the end (delta: 674.4kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 162.24ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 83.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1163.98ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 103.6MB in the end (delta: -20.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 6 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, 33 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 14 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 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: 36ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:45:21,574 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-02-17 22:45:21,776 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...