/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/me0.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:23,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:23,047 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:23,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:23,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:23,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:23,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:23,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:23,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:23,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:23,072 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:23,072 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:23,072 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:23,072 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:23,072 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:23,072 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:23,072 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:23,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:23,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:23,072 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:23,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:23,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:23,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:23,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:23,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:23,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:23,073 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:23,073 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:23,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:23,073 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:23,073 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:23,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:23,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:23,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:23,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:23,073 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:23,073 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:23,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:23,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:23,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:23,295 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:23,298 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:23,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/me0.c.bpl [2025-04-26 16:24:23,299 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/me0.c.bpl' [2025-04-26 16:24:23,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:23,313 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:23,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:23,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:23,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:23,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "me0.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:23" (1/1) ... [2025-04-26 16:24:23,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "me0.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:23" (1/1) ... [2025-04-26 16:24:23,345 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:23,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:23,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:23,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:23,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:23,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "me0.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:23" (1/1) ... [2025-04-26 16:24:23,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "me0.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:23" (1/1) ... [2025-04-26 16:24:23,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "me0.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:23" (1/1) ... [2025-04-26 16:24:23,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "me0.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:23" (1/1) ... [2025-04-26 16:24:23,355 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "me0.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:23" (1/1) ... [2025-04-26 16:24:23,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "me0.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:23" (1/1) ... [2025-04-26 16:24:23,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "me0.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:23" (1/1) ... [2025-04-26 16:24:23,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "me0.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:23" (1/1) ... [2025-04-26 16:24:23,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "me0.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:23" (1/1) ... [2025-04-26 16:24:23,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:23,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:23,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:23,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:23,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "me0.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:23" (1/1) ... [2025-04-26 16:24:23,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:23,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:23,397 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:23,400 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:23,420 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:23,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:23,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:23,420 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:23,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:23,421 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:23,421 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:23,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:23,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:23,421 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:23,456 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:23,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:23,528 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:23,528 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:23,537 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:23,537 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:23,538 INFO L201 PluginConnector]: Adding new model me0.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:23 BoogieIcfgContainer [2025-04-26 16:24:23,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:23,539 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:23,539 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:23,544 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:23,544 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:23,544 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me0.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:23" (1/2) ... [2025-04-26 16:24:23,545 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25639b62 and model type me0.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:23, skipping insertion in model container [2025-04-26 16:24:23,545 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:23,546 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me0.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:23" (2/2) ... [2025-04-26 16:24:23,547 INFO L376 chiAutomizerObserver]: Analyzing ICFG me0.c.bpl [2025-04-26 16:24:23,591 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:24:23,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 16:24:23,646 INFO L116 PetriNetUnfolderBase]: 2/16 cut-off events. [2025-04-26 16:24:23,647 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:24:23,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 2/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-04-26 16:24:23,653 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 16:24:23,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 44 flow [2025-04-26 16:24:23,659 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 21 places, 16 transitions, 44 flow [2025-04-26 16:24:23,667 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:23,667 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:23,667 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:23,667 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:23,668 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:23,668 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:23,668 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:23,668 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:23,669 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:23,689 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 20 [2025-04-26 16:24:23,689 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:23,689 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:23,691 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:23,692 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:23,692 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:23,692 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 38 states, but on-demand construction may add more states [2025-04-26 16:24:23,693 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 20 [2025-04-26 16:24:23,694 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:23,694 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:23,694 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:23,694 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:23,698 INFO L752 eck$LassoCheckResult]: Stem: "[32] $Ultimate##0-->L10: Formula: (= v_f_4 0) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" "[51] L10-->L19: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:23,698 INFO L754 eck$LassoCheckResult]: Loop: "[40] L19-->L21: 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[]" "[42] L21-->L19: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:23,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2004, now seen corresponding path program 1 times [2025-04-26 16:24:23,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:23,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385305520] [2025-04-26 16:24:23,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:23,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:23,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:23,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:23,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:23,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:23,758 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:23,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:23,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:23,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:23,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:23,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:23,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:23,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2025-04-26 16:24:23,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:23,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059213419] [2025-04-26 16:24:23,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:23,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:23,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:23,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:23,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:23,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:23,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:23,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:23,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:23,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:23,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:23,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:23,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1927126, now seen corresponding path program 1 times [2025-04-26 16:24:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:23,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020679947] [2025-04-26 16:24:23,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:23,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:23,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:23,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:23,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:23,782 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:23,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:23,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:23,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:23,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:23,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:23,817 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:23,818 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:23,818 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:23,818 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:23,818 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:23,818 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:23,818 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:23,818 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:23,818 INFO L132 ssoRankerPreferences]: Filename of dumped script: me0.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:23,818 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:23,819 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:23,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:23,862 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:23,862 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:23,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:23,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:23,869 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:23,870 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:23,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:23,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:23,891 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:23,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:23,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:23,893 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:23,894 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:23,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:23,896 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:23,962 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:23,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:23,966 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:23,966 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:23,966 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:23,966 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:23,966 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:23,966 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:23,966 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:23,966 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:23,966 INFO L132 ssoRankerPreferences]: Filename of dumped script: me0.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:23,967 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:23,967 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:23,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:23,996 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:23,999 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:24,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:24,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:24,003 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:24,004 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:24,005 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:24,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:24,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:24,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:24,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:24,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:24,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:24,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:24,028 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:24,033 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:24,033 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:24,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:24,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:24,036 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:24,037 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:24,038 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:24,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:24:24,042 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:24,042 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:24,043 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:24:24,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:24:24,051 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:24,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:24,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:24,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:24,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:24,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:24,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:24,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:24,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:24,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:24,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:24,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:24,095 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:24,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:24,115 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:24,140 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:24,166 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 38 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:24,303 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 38 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 122 states and 250 transitions. Complement of second has 7 states. [2025-04-26 16:24:24,307 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:24,311 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:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2025-04-26 16:24:24,326 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:24,332 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:24,332 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:24,332 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:24,336 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:24,336 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:24,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 250 transitions. [2025-04-26 16:24:24,351 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:24:24,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 61 states and 128 transitions. [2025-04-26 16:24:24,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-04-26 16:24:24,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-04-26 16:24:24,359 INFO L74 IsDeterministic]: Start isDeterministic. Operand 61 states and 128 transitions. [2025-04-26 16:24:24,359 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:24,359 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 128 transitions. [2025-04-26 16:24:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 128 transitions. [2025-04-26 16:24:24,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2025-04-26 16:24:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.159090909090909) internal successors, (in total 95), 43 states have internal predecessors, (95), 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:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 95 transitions. [2025-04-26 16:24:24,413 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 95 transitions. [2025-04-26 16:24:24,413 INFO L438 stractBuchiCegarLoop]: Abstraction has 44 states and 95 transitions. [2025-04-26 16:24:24,413 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:24,413 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 95 transitions. [2025-04-26 16:24:24,418 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:24:24,418 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:24,419 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:24,419 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:24,419 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:24,420 INFO L752 eck$LassoCheckResult]: Stem: "[32] $Ultimate##0-->L10: Formula: (= v_f_4 0) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" "[51] L10-->L19: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[54] L10-1-->$Ultimate##0: 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]" "[39] L19-->L23: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[44] $Ultimate##0-->L30-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:24:24,420 INFO L754 eck$LassoCheckResult]: Loop: "[46] L30-1-->L32: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[48] L32-->L30-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:24,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:24,422 INFO L85 PathProgramCache]: Analyzing trace with hash 59754311, now seen corresponding path program 1 times [2025-04-26 16:24:24,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:24,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097875859] [2025-04-26 16:24:24,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:24,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:24,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:24,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:24,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:24,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:24,465 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:24,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:24,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097875859] [2025-04-26 16:24:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097875859] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:24,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:24:24,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910922898] [2025-04-26 16:24:24,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:24,469 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:24:24,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:24,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2025-04-26 16:24:24,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:24,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009843144] [2025-04-26 16:24:24,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:24,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:24,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:24,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:24,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:24,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:24,473 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:24,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:24,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:24,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:24,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:24,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:24,489 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:24,489 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:24,489 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:24,489 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:24,489 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:24,489 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:24,489 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:24,489 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:24,489 INFO L132 ssoRankerPreferences]: Filename of dumped script: me0.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:24,489 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:24,489 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:24,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:24,520 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:24,520 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:24,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:24,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:24,524 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:24,525 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:24,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:24,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:24,544 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:24,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:24,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:24,546 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:24,547 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:24,548 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:24,548 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:24,622 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:24,626 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:24,626 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:24,626 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:24,627 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:24,627 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:24,627 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:24,627 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:24,627 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:24,627 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:24,627 INFO L132 ssoRankerPreferences]: Filename of dumped script: me0.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:24,627 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:24,627 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:24,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:24,653 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:24,653 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:24,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:24,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:24,655 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:24,656 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:24,657 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:24,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:24,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:24,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:24,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:24,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:24,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:24,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:24,673 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:24,676 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:24,676 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:24,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:24,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:24,678 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:24,680 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:24,681 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:24,684 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:24,684 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:24,684 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:24,684 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, x1) = -1*y + 1*x1 Supporting invariants [] [2025-04-26 16:24:24,690 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:24,692 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:24,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:24,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:24,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:24,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:24,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:24,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:24,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:24,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:24,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:24,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:24,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:24,727 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:24,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:24,741 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:24,741 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:24,742 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 95 transitions. cyclomatic complexity: 62 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:24,791 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 95 transitions. cyclomatic complexity: 62. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 109 states and 221 transitions. Complement of second has 7 states. [2025-04-26 16:24:24,792 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:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2025-04-26 16:24:24,792 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:24,793 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:24,793 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:24:24,793 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:24,793 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:24:24,793 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:24,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 221 transitions. [2025-04-26 16:24:24,795 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:24:24,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 60 states and 120 transitions. [2025-04-26 16:24:24,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-04-26 16:24:24,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-04-26 16:24:24,796 INFO L74 IsDeterministic]: Start isDeterministic. Operand 60 states and 120 transitions. [2025-04-26 16:24:24,796 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:24,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 120 transitions. [2025-04-26 16:24:24,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 120 transitions. [2025-04-26 16:24:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2025-04-26 16:24:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.108695652173913) internal successors, (in total 97), 45 states have internal predecessors, (97), 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:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 97 transitions. [2025-04-26 16:24:24,800 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 97 transitions. [2025-04-26 16:24:24,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:24,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:24:24,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:24:24,803 INFO L87 Difference]: Start difference. First operand 46 states and 97 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 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:24,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:24,807 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2025-04-26 16:24:24,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 18 transitions. [2025-04-26 16:24:24,808 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:24,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2025-04-26 16:24:24,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:24,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:24,808 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:24,808 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:24,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:24,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:24,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:24:24,809 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:24,809 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:24,809 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:24,809 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:24,809 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:24,814 INFO L201 PluginConnector]: Adding new model me0.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:24 BoogieIcfgContainer [2025-04-26 16:24:24,814 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:24,815 INFO L158 Benchmark]: Toolchain (without parser) took 1502.06ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 89.5MB in the beginning and 79.4MB in the end (delta: 10.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:24,815 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:24,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.65ms. Allocated memory is still 163.6MB. Free memory was 89.3MB in the beginning and 87.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:24,815 INFO L158 Benchmark]: Boogie Preprocessor took 21.01ms. Allocated memory is still 163.6MB. Free memory was 87.4MB in the beginning and 86.5MB in the end (delta: 946.6kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:24:24,815 INFO L158 Benchmark]: RCFGBuilder took 168.58ms. Allocated memory is still 163.6MB. Free memory was 86.5MB in the beginning and 77.8MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:24,816 INFO L158 Benchmark]: BuchiAutomizer took 1275.37ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 77.7MB in the beginning and 79.4MB in the end (delta: -1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:24,817 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.17ms. Allocated memory is still 163.6MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.65ms. Allocated memory is still 163.6MB. Free memory was 89.3MB in the beginning and 87.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.01ms. Allocated memory is still 163.6MB. Free memory was 87.4MB in the beginning and 86.5MB in the end (delta: 946.6kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 168.58ms. Allocated memory is still 163.6MB. Free memory was 86.5MB in the beginning and 77.8MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1275.37ms. Allocated memory was 163.6MB in the beginning and 142.6MB in the end (delta: -21.0MB). Free memory was 77.7MB in the beginning and 79.4MB in the end (delta: -1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 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, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 23 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 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: 42ms 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: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 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 x1 + -1 * y and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 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:24,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...