/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/parallel/misc-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:39,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:39,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:39,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:39,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:39,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:40:39,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:39,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:39,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:39,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:39,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:39,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:39,952 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:39,952 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:39,952 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:39,952 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:39,952 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:39,952 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:39,952 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:39,952 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:39,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:39,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:39,952 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:39,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:39,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:39,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:39,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:39,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:39,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:39,953 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:39,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:39,953 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:39,953 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:39,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:39,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:39,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:39,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:39,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:39,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:39,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:39,954 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:39,954 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:39,954 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:40,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:40,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:40,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:40,174 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:40,174 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:40,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-4.wvr.bpl [2025-04-26 18:40:40,175 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-4.wvr.bpl' [2025-04-26 18:40:40,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:40,188 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:40,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:40,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:40,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:40,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:40" (1/1) ... [2025-04-26 18:40:40,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:40" (1/1) ... [2025-04-26 18:40:40,214 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:40,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:40,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:40,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:40,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:40,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:40" (1/1) ... [2025-04-26 18:40:40,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:40" (1/1) ... [2025-04-26 18:40:40,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:40" (1/1) ... [2025-04-26 18:40:40,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:40" (1/1) ... [2025-04-26 18:40:40,223 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:40" (1/1) ... [2025-04-26 18:40:40,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:40" (1/1) ... [2025-04-26 18:40:40,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:40" (1/1) ... [2025-04-26 18:40:40,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:40" (1/1) ... [2025-04-26 18:40:40,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:40" (1/1) ... [2025-04-26 18:40:40,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:40,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:40,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:40,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:40,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:40" (1/1) ... [2025-04-26 18:40:40,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:40,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:40,269 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:40:40,272 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:40:40,292 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:40,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:40,292 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:40,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:40,292 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:40,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:40,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:40,292 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:40:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:40:40,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:40:40,293 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:40:40,324 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:40,325 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:40,392 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:40,392 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:40,403 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:40,404 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:40:40,404 INFO L201 PluginConnector]: Adding new model misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:40 BoogieIcfgContainer [2025-04-26 18:40:40,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:40,405 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:40,405 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:40,410 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:40,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:40,411 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:40" (1/2) ... [2025-04-26 18:40:40,411 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@261fc7b and model type misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:40, skipping insertion in model container [2025-04-26 18:40:40,412 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:40,412 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:40" (2/2) ... [2025-04-26 18:40:40,413 INFO L376 chiAutomizerObserver]: Analyzing ICFG misc-4.wvr.bpl [2025-04-26 18:40:40,457 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:40:40,494 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:40,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:40,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:40,496 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:40:40,498 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:40:40,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 89 flow [2025-04-26 18:40:40,558 INFO L116 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-04-26 18:40:40,559 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:40:40,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 4/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-26 18:40:40,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 34 transitions, 89 flow [2025-04-26 18:40:40,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 28 transitions, 74 flow [2025-04-26 18:40:40,565 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 34 places, 28 transitions, 74 flow [2025-04-26 18:40:40,566 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 74 flow [2025-04-26 18:40:40,591 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 233 states, 231 states have (on average 2.9437229437229435) internal successors, (in total 680), 232 states have internal predecessors, (680), 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:40:40,593 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 233 states, 231 states have (on average 2.9437229437229435) internal successors, (in total 680), 232 states have internal predecessors, (680), 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:40:40,595 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:40,735 WARN L140 AmpleReduction]: Number of pruned transitions: 230 [2025-04-26 18:40:40,736 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:40:40,736 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 21 [2025-04-26 18:40:40,736 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:56 [2025-04-26 18:40:40,736 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:132 [2025-04-26 18:40:40,736 WARN L145 AmpleReduction]: Times succ was already a loop node:40 [2025-04-26 18:40:40,736 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:62 [2025-04-26 18:40:40,736 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:40,737 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 210 states, 208 states have (on average 1.7836538461538463) internal successors, (in total 371), 209 states have internal predecessors, (371), 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:40:40,743 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:40,743 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:40,743 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:40,743 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:40,743 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:40,743 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:40,744 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:40,744 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:40,747 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 210 states, 208 states have (on average 1.7836538461538463) internal successors, (in total 371), 209 states have internal predecessors, (371), 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:40:40,762 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 167 [2025-04-26 18:40:40,763 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:40,763 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:40,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:40,766 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:40:40,767 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:40,767 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 210 states, 208 states have (on average 1.7836538461538463) internal successors, (in total 371), 209 states have internal predecessors, (371), 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:40:40,772 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 167 [2025-04-26 18:40:40,772 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:40,772 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:40,772 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:40,772 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:40:40,776 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" [2025-04-26 18:40:40,777 INFO L754 eck$LassoCheckResult]: Loop: "[71] L17-->L18: Formula: v_v_assert_1 InVars {v_assert=v_v_assert_1} OutVars{v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[73] L18-->L19: Formula: v_d1_1 InVars {d1=v_d1_1} OutVars{d1=v_d1_1} AuxVars[] AssignedVars[]" "[75] L19-->L18-2: Formula: (= (+ v_pos_2 1) v_pos_1) InVars {pos=v_pos_2} OutVars{pos=v_pos_1} AuxVars[] AssignedVars[pos]" "[77] L18-2-->L17: Formula: (or (and v_d1_3 (not v_d1_4)) (and (not v_d1_3) v_d1_4)) InVars {d1=v_d1_4} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[d1]" [2025-04-26 18:40:40,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,780 INFO L85 PathProgramCache]: Analyzing trace with hash 3041, now seen corresponding path program 1 times [2025-04-26 18:40:40,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972371471] [2025-04-26 18:40:40,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:40,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:40,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:40,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:40,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,881 INFO L85 PathProgramCache]: Analyzing trace with hash 3111237, now seen corresponding path program 1 times [2025-04-26 18:40:40,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121134607] [2025-04-26 18:40:40,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:40,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:40,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,887 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:40,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:40,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1484352219, now seen corresponding path program 1 times [2025-04-26 18:40:40,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665094942] [2025-04-26 18:40:40,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:40,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:40,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:40,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:40,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,999 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:41,000 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:41,000 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:41,001 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:41,001 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:41,001 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,001 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:41,001 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:41,001 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:40:41,001 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:41,001 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:41,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,110 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:41,111 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:41,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,125 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:40:41,127 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:40:41,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:41,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:41,151 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:41,152 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite v_assert 1 0)_1=1} Honda state: {v_rep(ite v_assert 1 0)_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:41,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:41,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,160 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:40:41,162 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:40:41,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:41,163 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:41,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:41,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,183 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:40:41,184 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:40:41,187 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:41,187 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:41,211 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:41,212 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {pos=0} Honda state: {pos=0} Generalized eigenvectors: [{pos=-3}, {pos=2}, {pos=2}] Lambdas: [1, 0, 1] Nus: [0, 1] [2025-04-26 18:40:41,218 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:40:41,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,220 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:40:41,222 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:40:41,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:41,223 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:41,240 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 18:40:41,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,242 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:40:41,243 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:40:41,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:41,245 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:41,268 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:41,272 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:40:41,273 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:41,273 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:41,273 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:41,273 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:41,273 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:41,273 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,273 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:41,273 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:41,273 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:40:41,273 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:41,273 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:41,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,306 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:41,309 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:41,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,312 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:40:41,313 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:40:41,315 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:40:41,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:41,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:41,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:41,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:41,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:41,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:41,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:41,331 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:41,337 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 18:40:41,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,339 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:40:41,339 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:40:41,340 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:40:41,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:41,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:41,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:41,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:41,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:41,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:41,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:41,353 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:41,359 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 18:40:41,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,361 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:40:41,362 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:40:41,364 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:40:41,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:41,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:41,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:41,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:41,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:41,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:41,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:41,376 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:41,379 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:40:41,379 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:40:41,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,382 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 18:40:41,383 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 18:40:41,384 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:41,387 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 18:40:41,387 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:40:41,387 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:41,387 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d1 1 0)_2) = 1*v_rep(ite d1 1 0)_2 Supporting invariants [] [2025-04-26 18:40:41,393 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:40:41,395 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:41,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:41,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:41,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:41,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:41,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:41,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:41,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:41,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:41,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:41,440 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:41,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:41,471 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:40:41,484 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:40:41,486 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 210 states, 208 states have (on average 1.7836538461538463) internal successors, (in total 371), 209 states have internal predecessors, (371), 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 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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 18:40:41,573 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 210 states, 208 states have (on average 1.7836538461538463) internal successors, (in total 371), 209 states have internal predecessors, (371), 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 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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) Result 727 states and 1309 transitions. Complement of second has 8 states. [2025-04-26 18:40:41,575 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:40:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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 18:40:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2025-04-26 18:40:41,587 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:40:41,587 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:41,588 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:40:41,588 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:41,588 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 2 letters. Loop has 8 letters. [2025-04-26 18:40:41,588 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:41,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 727 states and 1309 transitions. [2025-04-26 18:40:41,599 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 237 [2025-04-26 18:40:41,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 727 states to 508 states and 933 transitions. [2025-04-26 18:40:41,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 335 [2025-04-26 18:40:41,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 391 [2025-04-26 18:40:41,609 INFO L74 IsDeterministic]: Start isDeterministic. Operand 508 states and 933 transitions. [2025-04-26 18:40:41,609 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:41,609 INFO L218 hiAutomatonCegarLoop]: Abstraction has 508 states and 933 transitions. [2025-04-26 18:40:41,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states and 933 transitions. [2025-04-26 18:40:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 357. [2025-04-26 18:40:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 357 states have (on average 1.9467787114845938) internal successors, (in total 695), 356 states have internal predecessors, (695), 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:40:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 695 transitions. [2025-04-26 18:40:41,645 INFO L240 hiAutomatonCegarLoop]: Abstraction has 357 states and 695 transitions. [2025-04-26 18:40:41,645 INFO L438 stractBuchiCegarLoop]: Abstraction has 357 states and 695 transitions. [2025-04-26 18:40:41,645 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:41,645 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 357 states and 695 transitions. [2025-04-26 18:40:41,646 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 187 [2025-04-26 18:40:41,646 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:41,647 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:41,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:40:41,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:40:41,647 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 18:40:41,647 INFO L754 eck$LassoCheckResult]: Loop: "[79] L33-->L34: Formula: v_v_assert_3 InVars {v_assert=v_v_assert_3} OutVars{v_assert=v_v_assert_3} AuxVars[] AssignedVars[]" "[82] L34-->L39: Formula: (not v_d2_2) InVars {d2=v_d2_2} OutVars{d2=v_d2_2} AuxVars[] AssignedVars[]" "[84] L39-->L34-2: Formula: (= v_pos_8 (+ 2 v_pos_7)) InVars {pos=v_pos_8} OutVars{pos=v_pos_7} AuxVars[] AssignedVars[pos]" "[85] L34-2-->L33: Formula: (or (and v_d2_3 (not v_d2_4)) (and v_d2_4 (not v_d2_3))) InVars {d2=v_d2_4} OutVars{d2=v_d2_3} AuxVars[] AssignedVars[d2]" [2025-04-26 18:40:41,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:41,648 INFO L85 PathProgramCache]: Analyzing trace with hash 94361, now seen corresponding path program 1 times [2025-04-26 18:40:41,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:41,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947532626] [2025-04-26 18:40:41,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:41,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:41,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:41,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:41,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:41,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:41,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:41,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:41,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:41,654 INFO L85 PathProgramCache]: Analyzing trace with hash 3358501, now seen corresponding path program 1 times [2025-04-26 18:40:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:41,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129777599] [2025-04-26 18:40:41,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:41,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:41,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:41,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:41,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:41,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:41,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:41,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:41,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1247454141, now seen corresponding path program 1 times [2025-04-26 18:40:41,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:41,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249035180] [2025-04-26 18:40:41,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:41,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:41,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:41,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:41,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:41,703 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:40:41,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:41,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249035180] [2025-04-26 18:40:41,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249035180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:41,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:41,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:40:41,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233286526] [2025-04-26 18:40:41,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:41,743 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:41,743 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:41,743 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:41,743 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:41,743 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:41,743 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,743 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:41,743 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:41,743 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:40:41,743 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:41,743 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:41,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,774 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:41,774 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:41,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,776 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 18:40:41,777 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 18:40:41,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:41,778 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:41,794 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 18:40:41,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,796 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 18:40:41,796 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 18:40:41,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:41,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:41,823 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:41,827 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 18:40:41,827 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:41,827 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:41,827 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:41,827 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:41,827 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:41,827 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,827 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:41,827 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:41,827 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:40:41,827 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:41,827 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:41,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,861 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:41,861 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:41,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,863 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 18:40:41,865 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 18:40:41,866 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:40:41,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:41,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:41,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:41,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:41,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:41,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:41,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:41,879 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:41,881 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:40:41,881 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:40:41,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,884 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 18:40:41,884 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 18:40:41,885 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:41,888 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:40:41,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:41,890 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:40:41,890 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:41,890 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d2 1 0)_2) = -2*v_rep(ite d2 1 0)_2 + 1 Supporting invariants [] [2025-04-26 18:40:41,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:41,898 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:41,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:41,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:41,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:41,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:41,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:41,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:41,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:41,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:41,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:41,922 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:41,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:41,949 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:40:41,950 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:40:41,950 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 357 states and 695 transitions. cyclomatic complexity: 372 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:41,994 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 357 states and 695 transitions. cyclomatic complexity: 372. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1255 states and 2435 transitions. Complement of second has 7 states. [2025-04-26 18:40:41,997 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:40:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-04-26 18:40:41,997 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:40:41,997 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:41,997 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:40:41,998 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:41,998 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 18:40:41,998 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:41,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1255 states and 2435 transitions. [2025-04-26 18:40:42,005 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 307 [2025-04-26 18:40:42,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1255 states to 1015 states and 1989 transitions. [2025-04-26 18:40:42,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 505 [2025-04-26 18:40:42,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 555 [2025-04-26 18:40:42,015 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1015 states and 1989 transitions. [2025-04-26 18:40:42,015 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:42,015 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1015 states and 1989 transitions. [2025-04-26 18:40:42,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states and 1989 transitions. [2025-04-26 18:40:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 784. [2025-04-26 18:40:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 784 states have (on average 2.0433673469387754) internal successors, (in total 1602), 783 states have internal predecessors, (1602), 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:40:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1602 transitions. [2025-04-26 18:40:42,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 784 states and 1602 transitions. [2025-04-26 18:40:42,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:42,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:40:42,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:40:42,038 INFO L87 Difference]: Start difference. First operand 784 states and 1602 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:42,056 INFO L93 Difference]: Finished difference Result 694 states and 1290 transitions. [2025-04-26 18:40:42,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 694 states and 1290 transitions. [2025-04-26 18:40:42,060 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 275 [2025-04-26 18:40:42,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 694 states to 584 states and 1100 transitions. [2025-04-26 18:40:42,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 391 [2025-04-26 18:40:42,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 391 [2025-04-26 18:40:42,063 INFO L74 IsDeterministic]: Start isDeterministic. Operand 584 states and 1100 transitions. [2025-04-26 18:40:42,063 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:42,063 INFO L218 hiAutomatonCegarLoop]: Abstraction has 584 states and 1100 transitions. [2025-04-26 18:40:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states and 1100 transitions. [2025-04-26 18:40:42,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 456. [2025-04-26 18:40:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 456 states have (on average 1.9714912280701755) internal successors, (in total 899), 455 states have internal predecessors, (899), 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:40:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 899 transitions. [2025-04-26 18:40:42,071 INFO L240 hiAutomatonCegarLoop]: Abstraction has 456 states and 899 transitions. [2025-04-26 18:40:42,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:40:42,072 INFO L438 stractBuchiCegarLoop]: Abstraction has 456 states and 899 transitions. [2025-04-26 18:40:42,072 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:42,072 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 456 states and 899 transitions. [2025-04-26 18:40:42,073 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 217 [2025-04-26 18:40:42,073 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:42,073 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:42,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:40:42,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:40:42,074 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[71] L17-->L18: Formula: v_v_assert_1 InVars {v_assert=v_v_assert_1} OutVars{v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[74] L18-->L23: Formula: (not v_d1_2) InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" [2025-04-26 18:40:42,074 INFO L754 eck$LassoCheckResult]: Loop: "[76] L23-->L18-2: Formula: (= v_pos_4 (+ v_pos_3 1)) InVars {pos=v_pos_4} OutVars{pos=v_pos_3} AuxVars[] AssignedVars[pos]" "[77] L18-2-->L17: Formula: (or (and v_d1_3 (not v_d1_4)) (and (not v_d1_3) v_d1_4)) InVars {d1=v_d1_4} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[d1]" "[71] L17-->L18: Formula: v_v_assert_1 InVars {v_assert=v_v_assert_1} OutVars{v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[74] L18-->L23: Formula: (not v_d1_2) InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" [2025-04-26 18:40:42,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:42,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2924676, now seen corresponding path program 1 times [2025-04-26 18:40:42,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:42,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062598533] [2025-04-26 18:40:42,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:42,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:42,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:42,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:42,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:42,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:42,090 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:40:42,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:42,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062598533] [2025-04-26 18:40:42,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062598533] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:42,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:42,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 18:40:42,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683396370] [2025-04-26 18:40:42,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:42,091 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:40:42,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:42,091 INFO L85 PathProgramCache]: Analyzing trace with hash 3263909, now seen corresponding path program 1 times [2025-04-26 18:40:42,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:42,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421060524] [2025-04-26 18:40:42,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:42,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:42,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:42,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:42,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:42,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:42,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:42,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:42,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:42,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:42,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:42,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:42,122 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:42,123 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:42,123 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:42,123 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:42,123 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:42,123 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,123 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:42,123 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:42,123 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:40:42,123 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:42,123 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:42,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:42,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:42,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:42,163 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:42,163 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:42,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:42,167 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 18:40:42,168 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 18:40:42,168 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:42,168 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:42,185 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:42,185 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite v_assert 1 0)_5=1} Honda state: {v_rep(ite v_assert 1 0)_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:42,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:40:42,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:42,202 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 18:40:42,203 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 18:40:42,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:42,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:42,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:40:42,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:42,241 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 18:40:42,242 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 18:40:42,242 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:42,242 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:42,264 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:42,268 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 18:40:42,268 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:42,268 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:42,268 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:42,268 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:42,268 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:42,268 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,268 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:42,268 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:42,268 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:40:42,268 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:42,268 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:42,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:42,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:42,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:42,300 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:42,300 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:42,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:42,302 INFO L229 MonitoredProcess]: Starting monitored process 19 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:40:42,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:40:42,305 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:40:42,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:42,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:42,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:42,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:42,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:42,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:42,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:42,316 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:42,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:40:42,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:42,325 INFO L229 MonitoredProcess]: Starting monitored process 20 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:40:42,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:40:42,328 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:40:42,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:42,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:42,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:42,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:42,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:42,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:42,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:42,340 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:42,341 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:40:42,341 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:40:42,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:42,343 INFO L229 MonitoredProcess]: Starting monitored process 21 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:40:42,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:40:42,345 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:42,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:40:42,348 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:40:42,348 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:42,348 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d1 1 0)_4) = 1*v_rep(ite d1 1 0)_4 Supporting invariants [] [2025-04-26 18:40:42,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:40:42,354 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:42,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:42,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:42,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:42,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:42,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:42,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:42,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:42,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:42,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:42,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:42,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:42,382 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:42,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:42,462 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:40:42,463 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:40:42,463 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 456 states and 899 transitions. cyclomatic complexity: 489 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 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 18:40:42,526 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 456 states and 899 transitions. cyclomatic complexity: 489. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 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 1596 states and 2989 transitions. Complement of second has 8 states. [2025-04-26 18:40:42,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 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 18:40:42,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2025-04-26 18:40:42,527 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:40:42,527 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:42,527 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:40:42,527 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:42,527 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 4 letters. Loop has 8 letters. [2025-04-26 18:40:42,527 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:42,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1596 states and 2989 transitions. [2025-04-26 18:40:42,535 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 552 [2025-04-26 18:40:42,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1596 states to 1392 states and 2635 transitions. [2025-04-26 18:40:42,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 768 [2025-04-26 18:40:42,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 819 [2025-04-26 18:40:42,543 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1392 states and 2635 transitions. [2025-04-26 18:40:42,543 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:42,543 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1392 states and 2635 transitions. [2025-04-26 18:40:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states and 2635 transitions. [2025-04-26 18:40:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1137. [2025-04-26 18:40:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1137 states have (on average 2.001759014951627) internal successors, (in total 2276), 1136 states have internal predecessors, (2276), 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:40:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 2276 transitions. [2025-04-26 18:40:42,562 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1137 states and 2276 transitions. [2025-04-26 18:40:42,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:42,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:40:42,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:40:42,563 INFO L87 Difference]: Start difference. First operand 1137 states and 2276 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 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 18:40:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:42,578 INFO L93 Difference]: Finished difference Result 1288 states and 2512 transitions. [2025-04-26 18:40:42,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1288 states and 2512 transitions. [2025-04-26 18:40:42,584 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 482 [2025-04-26 18:40:42,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1288 states to 1272 states and 2492 transitions. [2025-04-26 18:40:42,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 656 [2025-04-26 18:40:42,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 656 [2025-04-26 18:40:42,591 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1272 states and 2492 transitions. [2025-04-26 18:40:42,591 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:42,591 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1272 states and 2492 transitions. [2025-04-26 18:40:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states and 2492 transitions. [2025-04-26 18:40:42,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1164. [2025-04-26 18:40:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1164 states have (on average 2.0008591065292096) internal successors, (in total 2329), 1163 states have internal predecessors, (2329), 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:40:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 2329 transitions. [2025-04-26 18:40:42,609 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1164 states and 2329 transitions. [2025-04-26 18:40:42,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:40:42,610 INFO L438 stractBuchiCegarLoop]: Abstraction has 1164 states and 2329 transitions. [2025-04-26 18:40:42,610 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:42,610 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1164 states and 2329 transitions. [2025-04-26 18:40:42,613 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 442 [2025-04-26 18:40:42,614 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:42,614 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:42,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:42,614 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:40:42,614 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[79] L33-->L34: Formula: v_v_assert_3 InVars {v_assert=v_v_assert_3} OutVars{v_assert=v_v_assert_3} AuxVars[] AssignedVars[]" "[81] L34-->L35: Formula: v_d2_1 InVars {d2=v_d2_1} OutVars{d2=v_d2_1} AuxVars[] AssignedVars[]" [2025-04-26 18:40:42,614 INFO L754 eck$LassoCheckResult]: Loop: "[83] L35-->L34-2: Formula: (= (+ 2 v_pos_6) v_pos_5) InVars {pos=v_pos_6} OutVars{pos=v_pos_5} AuxVars[] AssignedVars[pos]" "[85] L34-2-->L33: Formula: (or (and v_d2_3 (not v_d2_4)) (and v_d2_4 (not v_d2_3))) InVars {d2=v_d2_4} OutVars{d2=v_d2_3} AuxVars[] AssignedVars[d2]" "[79] L33-->L34: Formula: v_v_assert_3 InVars {v_assert=v_v_assert_3} OutVars{v_assert=v_v_assert_3} AuxVars[] AssignedVars[]" "[81] L34-->L35: Formula: v_d2_1 InVars {d2=v_d2_1} OutVars{d2=v_d2_1} AuxVars[] AssignedVars[]" [2025-04-26 18:40:42,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:42,615 INFO L85 PathProgramCache]: Analyzing trace with hash 90683451, now seen corresponding path program 1 times [2025-04-26 18:40:42,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:42,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942222022] [2025-04-26 18:40:42,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:42,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:42,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:42,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:42,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:42,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:42,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:42,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:42,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:42,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:42,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:42,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:42,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:42,620 INFO L85 PathProgramCache]: Analyzing trace with hash 3480389, now seen corresponding path program 1 times [2025-04-26 18:40:42,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:42,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331895026] [2025-04-26 18:40:42,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:42,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:42,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:42,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:42,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:42,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:42,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:42,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:42,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:42,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:42,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:42,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:42,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:42,625 INFO L85 PathProgramCache]: Analyzing trace with hash 506603135, now seen corresponding path program 1 times [2025-04-26 18:40:42,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:42,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829948714] [2025-04-26 18:40:42,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:42,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:42,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:42,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:42,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:42,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:42,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:42,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829948714] [2025-04-26 18:40:42,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829948714] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:40:42,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539465378] [2025-04-26 18:40:42,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:42,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:40:42,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:42,650 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:40:42,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-26 18:40:42,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:42,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:42,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:42,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:42,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:40:42,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:42,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-26 18:40:42,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539465378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:42,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-26 18:40:42,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 3 [2025-04-26 18:40:42,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678866515] [2025-04-26 18:40:42,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:42,704 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:42,704 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:42,704 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:42,704 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:42,705 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:42,705 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,705 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:42,705 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:42,705 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 18:40:42,705 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:42,705 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:42,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:42,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:42,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:42,731 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:42,731 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:42,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:42,733 INFO L229 MonitoredProcess]: Starting monitored process 23 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:40:42,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:40:42,736 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:42,736 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:42,755 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:42,755 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite v_assert 1 0)_7=1} Honda state: {v_rep(ite v_assert 1 0)_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:42,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:42,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:42,764 INFO L229 MonitoredProcess]: Starting monitored process 24 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:40:42,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:40:42,766 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:42,766 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:42,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:40:42,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:42,785 INFO L229 MonitoredProcess]: Starting monitored process 25 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:40:42,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:40:42,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:42,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:42,808 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:42,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:40:42,812 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:42,813 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:42,813 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:42,813 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:42,813 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:42,813 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,813 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:42,813 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:42,813 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 18:40:42,813 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:42,813 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:42,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:42,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:42,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:42,843 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:42,843 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:42,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:42,845 INFO L229 MonitoredProcess]: Starting monitored process 26 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:40:42,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:40:42,849 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:40:42,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:42,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:42,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:42,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:42,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:42,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:42,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:42,862 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:42,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:40:42,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:42,869 INFO L229 MonitoredProcess]: Starting monitored process 27 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:40:42,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 18:40:42,872 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:40:42,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:42,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:42,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:42,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:42,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:42,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:42,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:42,884 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:42,886 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:40:42,886 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:40:42,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:42,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:42,889 INFO L229 MonitoredProcess]: Starting monitored process 28 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:40:42,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 18:40:42,891 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:42,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:40:42,894 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:40:42,894 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:42,894 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d2 1 0)_4) = -2*v_rep(ite d2 1 0)_4 + 1 Supporting invariants [] [2025-04-26 18:40:42,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:42,900 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:42,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:42,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:42,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:42,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:42,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:42,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:42,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:42,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:42,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:42,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:42,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:42,930 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:42,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:42,999 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:40:43,000 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:40:43,000 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1164 states and 2329 transitions. cyclomatic complexity: 1247 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:40:43,085 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1164 states and 2329 transitions. cyclomatic complexity: 1247. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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 6116 states and 11856 transitions. Complement of second has 8 states. [2025-04-26 18:40:43,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:40:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-04-26 18:40:43,086 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:40:43,086 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:43,086 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:40:43,086 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:43,086 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 18:40:43,086 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:43,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6116 states and 11856 transitions. [2025-04-26 18:40:43,117 INFO L131 ngComponentsAnalysis]: Automaton has 106 accepting balls. 1044 [2025-04-26 18:40:43,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6116 states to 5123 states and 10059 transitions. [2025-04-26 18:40:43,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1538 [2025-04-26 18:40:43,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1607 [2025-04-26 18:40:43,148 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5123 states and 10059 transitions. [2025-04-26 18:40:43,148 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:43,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5123 states and 10059 transitions. [2025-04-26 18:40:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5123 states and 10059 transitions. [2025-04-26 18:40:43,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5123 to 4308. [2025-04-26 18:40:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4308 states, 4308 states have (on average 2.02414113277623) internal successors, (in total 8720), 4307 states have internal predecessors, (8720), 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:40:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4308 states to 4308 states and 8720 transitions. [2025-04-26 18:40:43,228 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4308 states and 8720 transitions. [2025-04-26 18:40:43,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:43,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:43,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:43,228 INFO L87 Difference]: Start difference. First operand 4308 states and 8720 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:40:43,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:43,256 INFO L93 Difference]: Finished difference Result 3249 states and 6190 transitions. [2025-04-26 18:40:43,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3249 states and 6190 transitions. [2025-04-26 18:40:43,271 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 676 [2025-04-26 18:40:43,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3249 states to 1801 states and 3440 transitions. [2025-04-26 18:40:43,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 911 [2025-04-26 18:40:43,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 911 [2025-04-26 18:40:43,300 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1801 states and 3440 transitions. [2025-04-26 18:40:43,301 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:43,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1801 states and 3440 transitions. [2025-04-26 18:40:43,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states and 3440 transitions. [2025-04-26 18:40:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1301. [2025-04-26 18:40:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1301 states, 1301 states have (on average 1.9208301306687163) internal successors, (in total 2499), 1300 states have internal predecessors, (2499), 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:40:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 2499 transitions. [2025-04-26 18:40:43,322 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1301 states and 2499 transitions. [2025-04-26 18:40:43,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:40:43,324 INFO L438 stractBuchiCegarLoop]: Abstraction has 1301 states and 2499 transitions. [2025-04-26 18:40:43,324 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:40:43,324 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1301 states and 2499 transitions. [2025-04-26 18:40:43,327 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 532 [2025-04-26 18:40:43,328 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:43,328 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:43,328 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:40:43,328 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2025-04-26 18:40:43,328 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 18:40:43,328 INFO L754 eck$LassoCheckResult]: Loop: "[79] L33-->L34: Formula: v_v_assert_3 InVars {v_assert=v_v_assert_3} OutVars{v_assert=v_v_assert_3} AuxVars[] AssignedVars[]" "[81] L34-->L35: Formula: v_d2_1 InVars {d2=v_d2_1} OutVars{d2=v_d2_1} AuxVars[] AssignedVars[]" "[83] L35-->L34-2: Formula: (= (+ 2 v_pos_6) v_pos_5) InVars {pos=v_pos_6} OutVars{pos=v_pos_5} AuxVars[] AssignedVars[pos]" "[85] L34-2-->L33: Formula: (or (and v_d2_3 (not v_d2_4)) (and v_d2_4 (not v_d2_3))) InVars {d2=v_d2_4} OutVars{d2=v_d2_3} AuxVars[] AssignedVars[d2]" "[79] L33-->L34: Formula: v_v_assert_3 InVars {v_assert=v_v_assert_3} OutVars{v_assert=v_v_assert_3} AuxVars[] AssignedVars[]" "[82] L34-->L39: Formula: (not v_d2_2) InVars {d2=v_d2_2} OutVars{d2=v_d2_2} AuxVars[] AssignedVars[]" "[84] L39-->L34-2: Formula: (= v_pos_8 (+ 2 v_pos_7)) InVars {pos=v_pos_8} OutVars{pos=v_pos_7} AuxVars[] AssignedVars[pos]" "[85] L34-2-->L33: Formula: (or (and v_d2_3 (not v_d2_4)) (and v_d2_4 (not v_d2_3))) InVars {d2=v_d2_4} OutVars{d2=v_d2_3} AuxVars[] AssignedVars[d2]" [2025-04-26 18:40:43,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash 94361, now seen corresponding path program 2 times [2025-04-26 18:40:43,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:43,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361943464] [2025-04-26 18:40:43,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:43,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:43,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:43,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:43,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:43,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:43,332 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:43,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:43,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:43,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:43,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:43,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:43,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash -233883543, now seen corresponding path program 1 times [2025-04-26 18:40:43,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:43,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930371509] [2025-04-26 18:40:43,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:43,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:43,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:43,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:43,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:43,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:43,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:43,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:43,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:43,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:43,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:43,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:43,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1514311937, now seen corresponding path program 1 times [2025-04-26 18:40:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:43,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043143575] [2025-04-26 18:40:43,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:43,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:43,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:43,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:43,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:43,349 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:43,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:43,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:43,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:43,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:43,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:43,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:43,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:43,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:43,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:43,442 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:43,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:43,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:43,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:43,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:43,462 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:40:43,470 INFO L201 PluginConnector]: Adding new model misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:43 BoogieIcfgContainer [2025-04-26 18:40:43,470 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:43,471 INFO L158 Benchmark]: Toolchain (without parser) took 3282.91ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 85.6MB in the end (delta: -3.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:43,471 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:43,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.00ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 79.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:43,472 INFO L158 Benchmark]: Boogie Preprocessor took 23.80ms. Allocated memory is still 155.2MB. Free memory was 79.9MB in the beginning and 78.8MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:43,472 INFO L158 Benchmark]: RCFGBuilder took 163.80ms. Allocated memory is still 155.2MB. Free memory was 78.8MB in the beginning and 69.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:43,472 INFO L158 Benchmark]: BuchiAutomizer took 3065.72ms. Allocated memory is still 155.2MB. Free memory was 69.7MB in the beginning and 85.6MB in the end (delta: -15.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:43,473 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 83.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.00ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 79.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.80ms. Allocated memory is still 155.2MB. Free memory was 79.9MB in the beginning and 78.8MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 163.80ms. Allocated memory is still 155.2MB. Free memory was 78.8MB in the beginning and 69.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3065.72ms. Allocated memory is still 155.2MB. Free memory was 69.7MB in the beginning and 85.6MB in the end (delta: -15.9MB). 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.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 2188 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.1s 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, 262 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 523 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 173 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 247 mSDtfsCounter, 173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp54 ukn100 mio100 lsp100 div100 bol133 ite100 ukn100 eq150 hnf100 smp100 dnf100 smp100 tf116 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 246, Number of transitions in reduction automaton: 371, Number of states in reduction automaton: 210, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (if d1 then 1 else 0) and consists of 5 locations. One deterministic module has affine ranking function -2 * (if d2 then 1 else 0) + 1 and consists of 4 locations. One deterministic module has affine ranking function (if d1 then 1 else 0) and consists of 5 locations. One deterministic module has affine ranking function -2 * (if d2 then 1 else 0) + 1 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 1301 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 33]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L55] 0 assume pos == 0 && (d1 == d2 && d1 == true) && v_assert == true; VAL [d1=true, d2=true, pos=0, v_assert=true] [L56] FORK 0 fork 1 thread1(); VAL [d1=true, d2=true, pos=0, v_assert=true] [L57] FORK 0 fork 2, 2 thread2(); VAL [d1=true, d2=true, pos=0, v_assert=true] Loop: [L33] COND TRUE v_assert [L34] COND TRUE d2 [L35] pos := pos + 2; [L42] d2 := !d2; [L33] COND TRUE v_assert [L34] COND FALSE !(d2) [L39] pos := pos - 2; [L42] d2 := !d2; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 33]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L55] 0 assume pos == 0 && (d1 == d2 && d1 == true) && v_assert == true; VAL [d1=true, d2=true, pos=0, v_assert=true] [L56] FORK 0 fork 1 thread1(); VAL [d1=true, d2=true, pos=0, v_assert=true] [L57] FORK 0 fork 2, 2 thread2(); VAL [d1=true, d2=true, pos=0, v_assert=true] Loop: [L33] COND TRUE v_assert [L34] COND TRUE d2 [L35] pos := pos + 2; [L42] d2 := !d2; [L33] COND TRUE v_assert [L34] COND FALSE !(d2) [L39] pos := pos - 2; [L42] d2 := !d2; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:40:43,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:43,687 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...