/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 ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy11.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:53,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:53,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:53,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:53,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:53,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:53,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:53,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:53,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:53,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:53,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:53,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:53,675 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:53,675 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:53,675 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:53,675 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:53,675 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:53,675 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:53,676 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:53,676 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:53,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:53,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:53,676 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:53,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:53,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:53,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:53,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:53,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:53,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:53,676 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:53,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:53,676 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:53,676 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:53,676 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:53,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:53,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:53,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:53,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:53,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:53,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:53,677 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:53,677 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:53,677 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:53,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:53,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:53,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:53,905 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:53,906 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:53,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy11.wvr.bpl [2025-04-26 18:41:53,907 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy11.wvr.bpl' [2025-04-26 18:41:53,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:53,920 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:53,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:53,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:53,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:53,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:53" (1/1) ... [2025-04-26 18:41:53,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:53" (1/1) ... [2025-04-26 18:41:53,954 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:53,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:53,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:53,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:53,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:53,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:53" (1/1) ... [2025-04-26 18:41:53,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:53" (1/1) ... [2025-04-26 18:41:53,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:53" (1/1) ... [2025-04-26 18:41:53,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:53" (1/1) ... [2025-04-26 18:41:53,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:53" (1/1) ... [2025-04-26 18:41:53,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:53" (1/1) ... [2025-04-26 18:41:53,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:53" (1/1) ... [2025-04-26 18:41:53,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:53" (1/1) ... [2025-04-26 18:41:53,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:53" (1/1) ... [2025-04-26 18:41:53,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:53,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:53,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:53,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:53,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:53" (1/1) ... [2025-04-26 18:41:53,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:54,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:54,013 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 18:41:54,016 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 18:41:54,036 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:54,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:54,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:54,036 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:54,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:54,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:54,036 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:54,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:54,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:54,037 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 18:41:54,070 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:54,072 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:54,143 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:54,143 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:54,152 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:54,152 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:54,152 INFO L201 PluginConnector]: Adding new model easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:54 BoogieIcfgContainer [2025-04-26 18:41:54,152 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:54,153 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:54,153 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:54,158 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:54,159 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:54,159 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:53" (1/2) ... [2025-04-26 18:41:54,160 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d8fbbf3 and model type easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:54, skipping insertion in model container [2025-04-26 18:41:54,160 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:54,160 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:54" (2/2) ... [2025-04-26 18:41:54,161 INFO L376 chiAutomizerObserver]: Analyzing ICFG easy11.wvr.bpl [2025-04-26 18:41:54,215 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:41:54,257 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:54,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:54,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:54,260 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 18:41:54,262 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 18:41:54,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 64 flow [2025-04-26 18:41:54,325 INFO L116 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-04-26 18:41:54,328 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:41:54,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 21 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-04-26 18:41:54,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 64 flow [2025-04-26 18:41:54,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2025-04-26 18:41:54,335 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 21 transitions, 54 flow [2025-04-26 18:41:54,335 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions, 54 flow [2025-04-26 18:41:54,351 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 55 states, 53 states have (on average 1.9433962264150944) internal successors, (in total 103), 54 states have internal predecessors, (103), 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 18:41:54,351 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 55 states, 53 states have (on average 1.9433962264150944) internal successors, (in total 103), 54 states have internal predecessors, (103), 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 18:41:54,353 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:54,394 WARN L140 AmpleReduction]: Number of pruned transitions: 22 [2025-04-26 18:41:54,394 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:54,394 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 7 [2025-04-26 18:41:54,394 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:17 [2025-04-26 18:41:54,394 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:20 [2025-04-26 18:41:54,394 WARN L145 AmpleReduction]: Times succ was already a loop node:11 [2025-04-26 18:41:54,394 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:41:54,394 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:54,395 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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 18:41:54,399 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:54,400 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:54,400 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:54,400 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:54,400 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:54,400 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:54,400 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:54,400 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:54,401 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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 18:41:54,409 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18 [2025-04-26 18:41:54,409 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:54,409 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:54,411 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:54,411 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:54,411 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:54,411 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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 18:41:54,413 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18 [2025-04-26 18:41:54,413 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:54,413 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:54,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:54,413 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:54,416 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L38: Formula: (and (= v_Y_5 0) (<= v_X_3 10000)) InVars {Y=v_Y_5, X=v_X_3} OutVars{Y=v_Y_5, X=v_X_3} AuxVars[] AssignedVars[]" "[64] L38-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_x]" "[50] $Ultimate##0-->L17-1: Formula: (= v_X_1 v_thread1Thread1of1ForFork0_x_1) InVars {X=v_X_1, thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_1} OutVars{X=v_X_1, thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_1} AuxVars[] AssignedVars[]" [2025-04-26 18:41:54,417 INFO L754 eck$LassoCheckResult]: Loop: "[52] L17-1-->L18: Formula: (< v_thread1Thread1of1ForFork0_x_5 10000) InVars {thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_5} OutVars{thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_5} AuxVars[] AssignedVars[]" "[54] L18-->L17-1: Formula: (= v_thread1Thread1of1ForFork0_x_10 (+ v_thread1Thread1of1ForFork0_x_9 1)) InVars {thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_9} OutVars{thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_x]" [2025-04-26 18:41:54,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:54,420 INFO L85 PathProgramCache]: Analyzing trace with hash 71226, now seen corresponding path program 1 times [2025-04-26 18:41:54,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:54,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003596691] [2025-04-26 18:41:54,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:54,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:54,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:54,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:54,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:54,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:54,476 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:54,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:54,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:54,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:54,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:54,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:54,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:54,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2627, now seen corresponding path program 1 times [2025-04-26 18:41:54,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:54,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403447950] [2025-04-26 18:41:54,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:54,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:54,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:54,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:54,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:54,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:54,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:54,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:54,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:54,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:54,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:54,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:54,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:54,506 INFO L85 PathProgramCache]: Analyzing trace with hash 68449852, now seen corresponding path program 1 times [2025-04-26 18:41:54,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:54,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860295715] [2025-04-26 18:41:54,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:54,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:54,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:54,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:54,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:54,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:54,512 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:54,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:54,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:54,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:54,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:54,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:54,554 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:54,555 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:54,555 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:54,555 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:54,555 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:54,555 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:54,555 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:54,555 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:54,555 INFO L132 ssoRankerPreferences]: Filename of dumped script: easy11.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:41:54,555 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:54,555 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:54,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:54,600 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:54,601 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:54,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:54,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:54,629 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 18:41:54,631 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 18:41:54,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:54,637 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:54,718 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 18:41:54,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:54,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:54,720 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 18:41:54,722 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 18:41:54,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:54,723 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:54,751 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:54,756 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 18:41:54,756 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:54,756 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:54,756 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:54,756 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:54,756 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:54,756 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:54,756 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:54,756 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:54,756 INFO L132 ssoRankerPreferences]: Filename of dumped script: easy11.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:41:54,757 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:54,757 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:54,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:54,785 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:54,789 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:54,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:54,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:54,792 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 18:41:54,793 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 18:41:54,795 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 18:41:54,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:54,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:54,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:54,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:54,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:54,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:54,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:54,815 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:54,818 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:41:54,818 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:54,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:54,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:54,821 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 18:41:54,823 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 18:41:54,824 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:54,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:54,828 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:54,828 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:54,828 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_x) = -2*thread1Thread1of1ForFork0_x + 19999 Supporting invariants [] [2025-04-26 18:41:54,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:54,836 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:54,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:54,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:54,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:54,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:54,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:54,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:54,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:54,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:54,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:54,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:54,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:54,891 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:54,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:54,908 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 18:41:54,947 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 18:41:54,948 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:55,028 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 94 states and 132 transitions. Complement of second has 7 states. [2025-04-26 18:41:55,029 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 18:41:55,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2025-04-26 18:41:55,037 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:41:55,037 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:55,037 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:41:55,037 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:55,037 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:41:55,037 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:55,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 132 transitions. [2025-04-26 18:41:55,040 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:41:55,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 26 states and 36 transitions. [2025-04-26 18:41:55,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-04-26 18:41:55,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-04-26 18:41:55,043 INFO L74 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2025-04-26 18:41:55,043 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:55,043 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-04-26 18:41:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2025-04-26 18:41:55,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-04-26 18:41:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.4) internal successors, (in total 35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2025-04-26 18:41:55,056 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 35 transitions. [2025-04-26 18:41:55,056 INFO L438 stractBuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2025-04-26 18:41:55,057 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:55,057 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2025-04-26 18:41:55,057 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:41:55,057 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:55,057 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:55,058 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:55,058 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:55,058 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L38: Formula: (and (= v_Y_5 0) (<= v_X_3 10000)) InVars {Y=v_Y_5, X=v_X_3} OutVars{Y=v_Y_5, X=v_X_3} AuxVars[] AssignedVars[]" "[64] L38-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_x]" "[50] $Ultimate##0-->L17-1: Formula: (= v_X_1 v_thread1Thread1of1ForFork0_x_1) InVars {X=v_X_1, thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_1} OutVars{X=v_X_1, thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_1} AuxVars[] AssignedVars[]" "[51] L17-1-->L20: Formula: (<= 10000 v_thread1Thread1of1ForFork0_x_3) InVars {thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_3} OutVars{thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_3} AuxVars[] AssignedVars[]" "[53] L20-->thread1FINAL: Formula: (= (+ v_Y_2 v_thread1Thread1of1ForFork0_x_7) v_Y_1) InVars {Y=v_Y_2, thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_7} OutVars{Y=v_Y_1, thread1Thread1of1ForFork0_x=v_thread1Thread1of1ForFork0_x_7} AuxVars[] AssignedVars[Y]" "[55] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[67] L38-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_x=v_thread2Thread1of1ForFork1_x_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_x, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[56] $Ultimate##0-->L28-1: Formula: (= v_X_2 v_thread2Thread1of1ForFork1_x_1) InVars {thread2Thread1of1ForFork1_x=v_thread2Thread1of1ForFork1_x_1, X=v_X_2} OutVars{thread2Thread1of1ForFork1_x=v_thread2Thread1of1ForFork1_x_1, X=v_X_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:55,058 INFO L754 eck$LassoCheckResult]: Loop: "[58] L28-1-->L29: Formula: (< v_thread2Thread1of1ForFork1_x_5 10000) InVars {thread2Thread1of1ForFork1_x=v_thread2Thread1of1ForFork1_x_5} OutVars{thread2Thread1of1ForFork1_x=v_thread2Thread1of1ForFork1_x_5} AuxVars[] AssignedVars[]" "[60] L29-->L28-1: Formula: (= v_thread2Thread1of1ForFork1_x_10 (+ v_thread2Thread1of1ForFork1_x_9 1)) InVars {thread2Thread1of1ForFork1_x=v_thread2Thread1of1ForFork1_x_9} OutVars{thread2Thread1of1ForFork1_x=v_thread2Thread1of1ForFork1_x_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_x]" [2025-04-26 18:41:55,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash -920822992, now seen corresponding path program 1 times [2025-04-26 18:41:55,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:55,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879577631] [2025-04-26 18:41:55,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:55,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:55,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:55,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:55,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:55,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:55,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:55,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:55,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:55,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:55,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:55,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:55,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:55,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2819, now seen corresponding path program 1 times [2025-04-26 18:41:55,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:55,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394133035] [2025-04-26 18:41:55,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:55,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:55,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:55,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:55,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:55,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:55,070 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:55,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:55,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:55,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:55,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:55,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:55,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:55,073 INFO L85 PathProgramCache]: Analyzing trace with hash -147630478, now seen corresponding path program 1 times [2025-04-26 18:41:55,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:55,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621526131] [2025-04-26 18:41:55,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:55,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:55,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:55,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:55,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:55,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:55,142 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 18:41:55,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:55,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621526131] [2025-04-26 18:41:55,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621526131] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:55,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:55,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:41:55,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779441718] [2025-04-26 18:41:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:55,163 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:55,163 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:55,163 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:55,163 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:55,163 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:55,163 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:55,163 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:55,163 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:55,163 INFO L132 ssoRankerPreferences]: Filename of dumped script: easy11.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:41:55,163 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:55,164 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:55,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:55,194 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:55,194 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:55,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:55,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:55,196 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 18:41:55,198 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 18:41:55,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:55,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:55,214 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 18:41:55,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:55,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:55,216 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 18:41:55,217 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 18:41:55,218 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:55,218 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:55,243 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:55,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:55,247 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:55,247 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:55,247 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:55,247 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:55,247 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:55,247 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:55,247 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:55,247 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:55,247 INFO L132 ssoRankerPreferences]: Filename of dumped script: easy11.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:41:55,247 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:55,247 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:55,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:55,263 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:55,263 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:55,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:55,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:55,265 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 18:41:55,267 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 18:41:55,269 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 18:41:55,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:55,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:55,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:55,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:55,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:55,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:55,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:55,285 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:55,286 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:41:55,286 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:55,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:55,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:55,288 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 18:41:55,289 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 18:41:55,290 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:55,293 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 18:41:55,293 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:55,293 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:55,293 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_x) = -2*thread2Thread1of1ForFork1_x + 19999 Supporting invariants [] [2025-04-26 18:41:55,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:55,300 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:55,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:55,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:55,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:55,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:55,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:55,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:55,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:55,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:55,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:55,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:55,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:55,348 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:55,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:55,363 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 18:41:55,363 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 18:41:55,364 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 18:41:55,402 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 44 states and 61 transitions. Complement of second has 6 states. [2025-04-26 18:41:55,405 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 18:41:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 18:41:55,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2025-04-26 18:41:55,406 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:41:55,407 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:55,407 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:41:55,407 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:55,407 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:41:55,407 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:55,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 61 transitions. [2025-04-26 18:41:55,408 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:55,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2025-04-26 18:41:55,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:55,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:55,408 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:55,408 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:55,408 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:55,408 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:55,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:55,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:41:55,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:41:55,413 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 5 states have internal predecessors, (10), 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 18:41:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:55,415 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:41:55,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:41:55,415 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:55,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:41:55,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:55,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:55,415 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:55,415 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:55,415 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:55,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:55,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:41:55,416 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:55,416 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:55,416 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:55,416 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:55,416 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:55,426 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 18:41:55,428 INFO L201 PluginConnector]: Adding new model easy11.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:55 BoogieIcfgContainer [2025-04-26 18:41:55,428 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:55,429 INFO L158 Benchmark]: Toolchain (without parser) took 1508.59ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.1MB in the beginning and 84.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:55,429 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:55,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.46ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:55,429 INFO L158 Benchmark]: Boogie Preprocessor took 23.14ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 990.6kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:55,429 INFO L158 Benchmark]: RCFGBuilder took 171.14ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 74.2MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:55,430 INFO L158 Benchmark]: BuchiAutomizer took 1275.02ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.2MB in the beginning and 84.3MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:55,431 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.21ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.46ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.14ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 990.6kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 171.14ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 74.2MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1275.02ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.2MB in the beginning and 84.3MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 30 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 38ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 141, Number of transitions in reduction automaton: 61, Number of states in reduction automaton: 45, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19999 + x * -2 and consists of 5 locations. One deterministic module has affine ranking function x * -2 + 19999 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:55,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...