/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/3_thr/me1-1p2c.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:57:01,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:57:01,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:57:01,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:57:01,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:57:01,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:57:01,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:57:01,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:57:01,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:57:01,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:57:01,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:57:01,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:57:01,979 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:57:01,979 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:57:01,979 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:57:01,979 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:57:01,979 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:57:01,979 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:57:01,979 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:57:01,979 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:57:01,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:57:01,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:57:01,980 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:57:01,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:57:01,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:57:01,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:57:01,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:57:01,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:57:01,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:57:01,980 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:57:01,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:57:01,980 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:57:01,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:57:01,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:57:01,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:57:01,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:01,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:57:01,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:57:01,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:57:01,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:57:01,981 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:57:01,981 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:57:01,981 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:57:02,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:57:02,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:57:02,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:57:02,232 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:57:02,234 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:57:02,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/me1-1p2c.c.bpl [2025-04-26 16:57:02,235 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/me1-1p2c.c.bpl' [2025-04-26 16:57:02,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:57:02,251 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:57:02,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:02,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:57:02,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:57:02,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,281 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:57:02,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:02,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:57:02,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:57:02,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:57:02,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:57:02,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:57:02,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:57:02,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:57:02,316 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:02,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:02,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:57:02,363 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:57:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:57:02,364 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:57:02,364 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:57:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:57:02,364 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:57:02,364 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:57:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:57:02,364 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:57:02,364 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:57:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:57:02,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:57:02,365 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:57:02,400 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:57:02,401 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:57:02,487 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:57:02,487 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:57:02,504 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:57:02,504 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:57:02,504 INFO L201 PluginConnector]: Adding new model me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:02 BoogieIcfgContainer [2025-04-26 16:57:02,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:57:02,506 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:57:02,506 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:57:02,512 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:57:02,512 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:02,513 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/2) ... [2025-04-26 16:57:02,514 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1381b5c7 and model type me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:57:02, skipping insertion in model container [2025-04-26 16:57:02,514 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:02,514 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:02" (2/2) ... [2025-04-26 16:57:02,515 INFO L376 chiAutomizerObserver]: Analyzing ICFG me1-1p2c.c.bpl [2025-04-26 16:57:02,566 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:57:02,602 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:57:02,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:57:02,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:02,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:57:02,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 79 flow [2025-04-26 16:57:02,680 INFO L116 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-04-26 16:57:02,682 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:57:02,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 3/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:57:02,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 79 flow [2025-04-26 16:57:02,691 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 64 flow [2025-04-26 16:57:02,691 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 23 transitions, 64 flow [2025-04-26 16:57:02,697 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:57:02,888 WARN L140 AmpleReduction]: Number of pruned transitions: 152 [2025-04-26 16:57:02,888 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:57:02,888 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 9 [2025-04-26 16:57:02,888 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:64 [2025-04-26 16:57:02,890 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:76 [2025-04-26 16:57:02,891 WARN L145 AmpleReduction]: Times succ was already a loop node:55 [2025-04-26 16:57:02,891 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:57:02,891 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:57:02,893 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 150 states, 149 states have (on average 1.8993288590604027) internal successors, (in total 283), 149 states have internal predecessors, (283), 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:57:02,900 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:57:02,900 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:57:02,900 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:57:02,900 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:57:02,900 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:57:02,900 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:57:02,900 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:57:02,900 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:57:02,903 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 150 states, 149 states have (on average 1.8993288590604027) internal successors, (in total 283), 149 states have internal predecessors, (283), 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:57:02,918 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 70 [2025-04-26 16:57:02,919 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:02,919 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:02,923 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:57:02,923 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:02,923 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:57:02,923 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 150 states, 149 states have (on average 1.8993288590604027) internal successors, (in total 283), 149 states have internal predecessors, (283), 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:57:02,927 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 70 [2025-04-26 16:57:02,927 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:02,927 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:02,927 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:57:02,928 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:02,931 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L14: Formula: (and (= v_g_5 0) (= v_f_1 0)) InVars {g=v_g_5, f=v_f_1} OutVars{g=v_g_5, f=v_f_1} AuxVars[] AssignedVars[]" "[78] L14-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:57:02,931 INFO L754 eck$LassoCheckResult]: Loop: "[62] L25-->L27: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[64] L27-->L25: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:57:02,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:02,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2713, now seen corresponding path program 1 times [2025-04-26 16:57:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:02,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691604546] [2025-04-26 16:57:02,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:02,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:02,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2025-04-26 16:57:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52857667] [2025-04-26 16:57:03,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,024 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2609179, now seen corresponding path program 1 times [2025-04-26 16:57:03,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449876765] [2025-04-26 16:57:03,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:03,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:03,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:03,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:03,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,076 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:03,077 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:03,077 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:03,077 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:03,077 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:03,077 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,077 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:03,077 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:03,077 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:03,077 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:03,077 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:03,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:03,118 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:03,119 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:03,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,122 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:57:03,122 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:57:03,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:03,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:03,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:57:03,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,143 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:57:03,146 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:57:03,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:03,163 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:03,230 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:03,234 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:57:03,234 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:03,235 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:03,235 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:03,235 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:03,235 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:03,235 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,235 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:03,235 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:03,235 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:03,235 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:03,235 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:03,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:03,260 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:03,263 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:03,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,267 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:57:03,269 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:57:03,270 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:57:03,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:03,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:03,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:03,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:03,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:03,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:03,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:03,289 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:03,294 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:03,294 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:03,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,297 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:57:03,299 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:57:03,300 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:03,303 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:57:03,303 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:03,303 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:03,304 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:57:03,309 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:57:03,311 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:03,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,386 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,414 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:57:03,432 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:57:03,434 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 150 states, 149 states have (on average 1.8993288590604027) internal successors, (in total 283), 149 states have internal predecessors, (283), 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) 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:57:03,565 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 150 states, 149 states have (on average 1.8993288590604027) internal successors, (in total 283), 149 states have internal predecessors, (283), 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). 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 520 states and 1090 transitions. Complement of second has 7 states. [2025-04-26 16:57:03,571 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:57:03,577 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:57:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-26 16:57:03,584 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:57:03,586 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,586 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:57:03,586 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,586 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:57:03,586 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 520 states and 1090 transitions. [2025-04-26 16:57:03,604 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 64 [2025-04-26 16:57:03,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 520 states to 382 states and 856 transitions. [2025-04-26 16:57:03,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2025-04-26 16:57:03,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 309 [2025-04-26 16:57:03,623 INFO L74 IsDeterministic]: Start isDeterministic. Operand 382 states and 856 transitions. [2025-04-26 16:57:03,623 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:03,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 382 states and 856 transitions. [2025-04-26 16:57:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states and 856 transitions. [2025-04-26 16:57:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 254. [2025-04-26 16:57:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 254 states have (on average 2.405511811023622) internal successors, (in total 611), 253 states have internal predecessors, (611), 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:57:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 611 transitions. [2025-04-26 16:57:03,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 254 states and 611 transitions. [2025-04-26 16:57:03,666 INFO L438 stractBuchiCegarLoop]: Abstraction has 254 states and 611 transitions. [2025-04-26 16:57:03,666 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:57:03,666 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 611 transitions. [2025-04-26 16:57:03,669 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 64 [2025-04-26 16:57:03,669 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:03,669 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:03,669 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:57:03,669 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:03,670 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L14: Formula: (and (= v_g_5 0) (= v_f_1 0)) InVars {g=v_g_5, f=v_f_1} OutVars{g=v_g_5, f=v_f_1} AuxVars[] AssignedVars[]" "[78] L14-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[81] L14-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]" "[66] $Ultimate##0-->L38-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[68] L38-1-->L38: Formula: (< v_y2_2 v_x2_6) InVars {y2=v_y2_2, x2=v_x2_6} OutVars{y2=v_y2_2, x2=v_x2_6} AuxVars[] AssignedVars[]" "[70] L38-->L38-1: Formula: (and (< v_y2_7 v_x2_16) (= (+ v_x2_15 1) v_x2_16)) InVars {y2=v_y2_7, x2=v_x2_16} OutVars{y2=v_y2_7, x2=v_x2_15} AuxVars[] AssignedVars[x2]" [2025-04-26 16:57:03,670 INFO L754 eck$LassoCheckResult]: Loop: "[68] L38-1-->L38: Formula: (< v_y2_2 v_x2_6) InVars {y2=v_y2_2, x2=v_x2_6} OutVars{y2=v_y2_2, x2=v_x2_6} AuxVars[] AssignedVars[]" "[70] L38-->L38-1: Formula: (and (< v_y2_7 v_x2_16) (= (+ v_x2_15 1) v_x2_16)) InVars {y2=v_y2_7, x2=v_x2_16} OutVars{y2=v_y2_7, x2=v_x2_15} AuxVars[] AssignedVars[x2]" [2025-04-26 16:57:03,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1786976148, now seen corresponding path program 1 times [2025-04-26 16:57:03,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303793422] [2025-04-26 16:57:03,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:03,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:03,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,717 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:57:03,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:57:03,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303793422] [2025-04-26 16:57:03,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303793422] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:57:03,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:57:03,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:57:03,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935295577] [2025-04-26 16:57:03,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:57:03,722 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:57:03,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2025-04-26 16:57:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527773337] [2025-04-26 16:57:03,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,749 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:03,750 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:03,750 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:03,750 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:03,750 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:03,750 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,750 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:03,750 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:03,750 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:03,750 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:03,750 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:03,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:03,771 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:03,771 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:03,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,787 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:57:03,788 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:57:03,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:03,789 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:03,805 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:57:03,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,807 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:57:03,808 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:57:03,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:03,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:03,880 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:03,885 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:57:03,885 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:03,885 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:03,885 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:03,885 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:03,885 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:03,885 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,885 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:03,885 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:03,886 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:03,886 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:03,886 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:03,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:03,903 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:03,904 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:03,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,905 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:57:03,906 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:57:03,910 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:57:03,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:03,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:03,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:03,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:03,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:03,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:03,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:03,923 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:03,925 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:03,925 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:03,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,927 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:03,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:57:03,932 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:03,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:57:03,936 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:03,936 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:03,936 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, y2) = 1*x2 - 1*y2 Supporting invariants [] [2025-04-26 16:57:03,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:57:03,942 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:03,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:03,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:03,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,976 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,990 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:57:03,991 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:57:03,991 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 254 states and 611 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:57:04,095 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 254 states and 611 transitions. cyclomatic complexity: 400. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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 730 states and 1600 transitions. Complement of second has 8 states. [2025-04-26 16:57:04,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:57:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-04-26 16:57:04,098 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 78 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:57:04,098 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,098 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 78 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:57:04,099 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,099 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 78 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:57:04,099 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 730 states and 1600 transitions. [2025-04-26 16:57:04,110 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 100 [2025-04-26 16:57:04,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 730 states to 486 states and 1165 transitions. [2025-04-26 16:57:04,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2025-04-26 16:57:04,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 354 [2025-04-26 16:57:04,121 INFO L74 IsDeterministic]: Start isDeterministic. Operand 486 states and 1165 transitions. [2025-04-26 16:57:04,122 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:04,122 INFO L218 hiAutomatonCegarLoop]: Abstraction has 486 states and 1165 transitions. [2025-04-26 16:57:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states and 1165 transitions. [2025-04-26 16:57:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 402. [2025-04-26 16:57:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 402 states have (on average 2.517412935323383) internal successors, (in total 1012), 401 states have internal predecessors, (1012), 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:57:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1012 transitions. [2025-04-26 16:57:04,151 INFO L240 hiAutomatonCegarLoop]: Abstraction has 402 states and 1012 transitions. [2025-04-26 16:57:04,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:57:04,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:57:04,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:57:04,154 INFO L87 Difference]: Start difference. First operand 402 states and 1012 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 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:57:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:57:04,174 INFO L93 Difference]: Finished difference Result 48 states and 76 transitions. [2025-04-26 16:57:04,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 76 transitions. [2025-04-26 16:57:04,175 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-04-26 16:57:04,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 45 states and 68 transitions. [2025-04-26 16:57:04,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-04-26 16:57:04,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-04-26 16:57:04,176 INFO L74 IsDeterministic]: Start isDeterministic. Operand 45 states and 68 transitions. [2025-04-26 16:57:04,176 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:04,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 68 transitions. [2025-04-26 16:57:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 68 transitions. [2025-04-26 16:57:04,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-04-26 16:57:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.511111111111111) internal successors, (in total 68), 44 states have internal predecessors, (68), 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:57:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 68 transitions. [2025-04-26 16:57:04,178 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 68 transitions. [2025-04-26 16:57:04,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:57:04,179 INFO L438 stractBuchiCegarLoop]: Abstraction has 45 states and 68 transitions. [2025-04-26 16:57:04,179 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:57:04,179 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 68 transitions. [2025-04-26 16:57:04,180 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-04-26 16:57:04,180 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:04,180 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:04,180 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:04,180 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:04,181 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L14: Formula: (and (= v_g_5 0) (= v_f_1 0)) InVars {g=v_g_5, f=v_f_1} OutVars{g=v_g_5, f=v_f_1} AuxVars[] AssignedVars[]" "[78] L14-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[81] L14-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]" "[84] L15-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[61] L25-->L29: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[63] L29-->thread1FINAL: Formula: (= v_g_1 (+ v_g_2 1)) InVars {g=v_g_2} OutVars{g=v_g_1} AuxVars[] AssignedVars[g]" "[66] $Ultimate##0-->L38-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[71] $Ultimate##0-->L52-1: Formula: (< 0 v_g_4) InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[65] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[85] thread1EXIT-->L17: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" [2025-04-26 16:57:04,181 INFO L754 eck$LassoCheckResult]: Loop: "[73] L52-1-->L52: Formula: (< v_y2_4 v_x2_10) InVars {y2=v_y2_4, x2=v_x2_10} OutVars{y2=v_y2_4, x2=v_x2_10} AuxVars[] AssignedVars[]" "[75] L52-->L52-1: Formula: (and (< v_y2_9 v_x2_20) (= v_x2_20 (+ v_x2_19 1))) InVars {y2=v_y2_9, x2=v_x2_20} OutVars{y2=v_y2_9, x2=v_x2_19} AuxVars[] AssignedVars[x2]" [2025-04-26 16:57:04,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash -290095273, now seen corresponding path program 1 times [2025-04-26 16:57:04,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:04,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413450796] [2025-04-26 16:57:04,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:04,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:04,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:57:04,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:57:04,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:04,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:57:04,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:57:04,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:04,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,196 INFO L85 PathProgramCache]: Analyzing trace with hash 3299, now seen corresponding path program 1 times [2025-04-26 16:57:04,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:04,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315275024] [2025-04-26 16:57:04,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:04,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:04,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:04,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:04,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,201 INFO L85 PathProgramCache]: Analyzing trace with hash 391319225, now seen corresponding path program 1 times [2025-04-26 16:57:04,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:04,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832896596] [2025-04-26 16:57:04,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:04,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:04,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:57:04,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:57:04,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:04,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:57:04,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:57:04,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:04,229 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:04,229 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:04,229 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:04,229 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:04,229 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:04,229 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,229 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:04,229 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:04,229 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:04,229 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:04,229 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:04,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:04,248 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:04,248 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:04,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,250 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:04,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:57:04,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:04,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:04,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:57:04,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,272 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:04,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:57:04,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:04,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:04,347 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:04,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:57:04,353 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:04,353 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:04,353 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:04,353 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:04,353 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:04,353 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,353 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:04,353 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:04,353 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:04,353 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:04,353 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:04,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:04,373 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:04,373 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:04,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,376 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:04,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:57:04,379 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:57:04,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:04,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:04,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:04,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:04,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:04,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:04,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:04,394 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:04,397 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:04,397 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:04,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,399 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:04,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:57:04,400 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:04,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:57:04,403 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:04,403 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:04,403 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, y2) = 1*x2 - 1*y2 Supporting invariants [] [2025-04-26 16:57:04,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:57:04,411 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:04,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:57:04,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:57:04,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:04,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:04,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:04,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:04,455 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:04,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:04,467 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:57:04,468 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:57:04,468 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 68 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:57:04,516 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 68 transitions. cyclomatic complexity: 32. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 69 states and 102 transitions. Complement of second has 7 states. [2025-04-26 16:57:04,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:57:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2025-04-26 16:57:04,518 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:57:04,518 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,518 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:57:04,518 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,518 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:57:04,518 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 102 transitions. [2025-04-26 16:57:04,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:57:04,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 22 states and 30 transitions. [2025-04-26 16:57:04,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-04-26 16:57:04,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-04-26 16:57:04,519 INFO L74 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2025-04-26 16:57:04,519 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:04,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-04-26 16:57:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2025-04-26 16:57:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-04-26 16:57:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (in total 30), 21 states have internal predecessors, (30), 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:57:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2025-04-26 16:57:04,520 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-04-26 16:57:04,520 INFO L438 stractBuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-04-26 16:57:04,520 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:57:04,520 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2025-04-26 16:57:04,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:57:04,520 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:04,520 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:04,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:04,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:04,521 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L14: Formula: (and (= v_g_5 0) (= v_f_1 0)) InVars {g=v_g_5, f=v_f_1} OutVars{g=v_g_5, f=v_f_1} AuxVars[] AssignedVars[]" "[78] L14-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[81] L14-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]" "[61] L25-->L29: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[63] L29-->thread1FINAL: Formula: (= v_g_1 (+ v_g_2 1)) InVars {g=v_g_2} OutVars{g=v_g_1} AuxVars[] AssignedVars[g]" "[66] $Ultimate##0-->L38-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[65] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[67] L38-1-->thread2FINAL: Formula: (<= v_x2_5 v_y2_1) InVars {y2=v_y2_1, x2=v_x2_5} OutVars{y2=v_y2_1, x2=v_x2_5} AuxVars[] AssignedVars[]" "[69] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] L15-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[71] $Ultimate##0-->L52-1: Formula: (< 0 v_g_4) InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" [2025-04-26 16:57:04,521 INFO L754 eck$LassoCheckResult]: Loop: "[73] L52-1-->L52: Formula: (< v_y2_4 v_x2_10) InVars {y2=v_y2_4, x2=v_x2_10} OutVars{y2=v_y2_4, x2=v_x2_10} AuxVars[] AssignedVars[]" "[75] L52-->L52-1: Formula: (and (< v_y2_9 v_x2_20) (= v_x2_20 (+ v_x2_19 1))) InVars {y2=v_y2_9, x2=v_x2_20} OutVars{y2=v_y2_9, x2=v_x2_19} AuxVars[] AssignedVars[x2]" [2025-04-26 16:57:04,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,521 INFO L85 PathProgramCache]: Analyzing trace with hash 26905102, now seen corresponding path program 1 times [2025-04-26 16:57:04,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:04,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423169759] [2025-04-26 16:57:04,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:04,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:04,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:04,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:04,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,525 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:04,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:04,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:04,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:04,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,529 INFO L85 PathProgramCache]: Analyzing trace with hash 3299, now seen corresponding path program 2 times [2025-04-26 16:57:04,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:04,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170698034] [2025-04-26 16:57:04,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:57:04,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:04,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:57:04,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:04,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:04,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,534 INFO L85 PathProgramCache]: Analyzing trace with hash 86001584, now seen corresponding path program 1 times [2025-04-26 16:57:04,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:04,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556231251] [2025-04-26 16:57:04,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:04,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:04,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:57:04,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:57:04,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:04,567 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:57:04,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:57:04,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556231251] [2025-04-26 16:57:04,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556231251] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:57:04,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:57:04,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:57:04,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886622770] [2025-04-26 16:57:04,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:57:04,581 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:04,581 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:04,581 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:04,581 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:04,582 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:04,582 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,582 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:04,582 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:04,582 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:04,582 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:04,582 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:04,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:04,596 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:04,596 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:04,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,599 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:04,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:57:04,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:04,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:04,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:57:04,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,623 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:04,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:57:04,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:04,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:04,697 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:04,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:04,702 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:04,702 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:04,702 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:04,702 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:04,702 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:04,702 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,702 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:04,702 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:04,702 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:04,702 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:04,702 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:04,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:04,718 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:04,718 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:04,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,720 INFO L229 MonitoredProcess]: Starting monitored process 17 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:57:04,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:57:04,723 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:57:04,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:04,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:04,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:04,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:04,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:04,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:04,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:04,735 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:04,739 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:04,739 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:04,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,767 INFO L229 MonitoredProcess]: Starting monitored process 18 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:57:04,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:57:04,769 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:04,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:57:04,772 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:04,772 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:04,772 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, x2) = -1*y2 + 1*x2 Supporting invariants [] [2025-04-26 16:57:04,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:04,779 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:04,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:04,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:04,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:04,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:04,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:04,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:04,832 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:04,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:04,872 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:57:04,873 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:57:04,873 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:57:04,891 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 24 states and 33 transitions. Complement of second has 4 states. [2025-04-26 16:57:04,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:57:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2025-04-26 16:57:04,892 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:57:04,892 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,892 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:57:04,892 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,892 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:57:04,892 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. [2025-04-26 16:57:04,893 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:04,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2025-04-26 16:57:04,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:57:04,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:57:04,893 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:57:04,893 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:57:04,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:04,893 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:04,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:57:04,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:57:04,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:57:04,893 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:57:04,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:57:04,893 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:57:04,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:57:04,893 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:04,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:57:04,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:57:04,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:57:04,894 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:57:04,894 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:57:04,894 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:04,894 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:04,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:57:04,894 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:04,894 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:57:04,894 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:57:04,894 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:04,894 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:57:04,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:57:04,908 INFO L201 PluginConnector]: Adding new model me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:57:04 BoogieIcfgContainer [2025-04-26 16:57:04,908 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:57:04,909 INFO L158 Benchmark]: Toolchain (without parser) took 2658.48ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 83.9MB in the beginning and 97.6MB in the end (delta: -13.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:04,909 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:04,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.13ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 81.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:04,910 INFO L158 Benchmark]: Boogie Preprocessor took 29.03ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 80.2MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:57:04,910 INFO L158 Benchmark]: RCFGBuilder took 191.65ms. Allocated memory is still 155.2MB. Free memory was 80.2MB in the beginning and 71.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:57:04,910 INFO L158 Benchmark]: BuchiAutomizer took 2402.38ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 70.9MB in the beginning and 97.6MB in the end (delta: -26.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:04,911 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 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.13ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 81.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.03ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 80.2MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 191.65ms. Allocated memory is still 155.2MB. Free memory was 80.2MB in the beginning and 71.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2402.38ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 70.9MB in the beginning and 97.6MB in the end (delta: -26.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 2.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 212 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 109 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 70 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 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: 39ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 295, Number of transitions in reduction automaton: 283, Number of states in reduction automaton: 150, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 5 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 5 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 3 locations. 2 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:57:04,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...