/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/chl/chromosome-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:08,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:08,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:08,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:08,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:08,766 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:08,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:08,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:08,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:08,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:08,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:08,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:08,788 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:08,788 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:08,788 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:08,788 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:08,788 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:08,788 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:08,788 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:08,788 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:08,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:08,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:08,789 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:08,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:08,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:08,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:08,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:08,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:08,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:08,789 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:08,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:08,789 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:08,789 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:08,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:08,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:08,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:08,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:08,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:08,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:08,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:08,790 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:08,790 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:08,790 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:09,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:09,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:09,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:09,038 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:09,039 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:09,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/chromosome-subst.wvr.bpl [2025-04-26 18:40:09,042 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/chromosome-subst.wvr.bpl' [2025-04-26 18:40:09,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:09,067 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:09,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:09,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:09,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:09,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:09" (1/1) ... [2025-04-26 18:40:09,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:09" (1/1) ... [2025-04-26 18:40:09,103 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:09,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:09,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:09,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:09,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:09,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:09" (1/1) ... [2025-04-26 18:40:09,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:09" (1/1) ... [2025-04-26 18:40:09,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:09" (1/1) ... [2025-04-26 18:40:09,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:09" (1/1) ... [2025-04-26 18:40:09,114 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:09" (1/1) ... [2025-04-26 18:40:09,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:09" (1/1) ... [2025-04-26 18:40:09,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:09" (1/1) ... [2025-04-26 18:40:09,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:09" (1/1) ... [2025-04-26 18:40:09,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:09" (1/1) ... [2025-04-26 18:40:09,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:09,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:09,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:09,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:09,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:09" (1/1) ... [2025-04-26 18:40:09,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:09,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:09,156 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:09,158 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:09,178 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:09,179 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:09,179 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:09,179 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:09,179 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:09,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:09,179 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:40:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:40:09,179 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:40:09,180 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:09,219 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:09,221 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:09,345 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:09,345 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:09,392 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:09,392 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 18:40:09,392 INFO L201 PluginConnector]: Adding new model chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:09 BoogieIcfgContainer [2025-04-26 18:40:09,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:09,393 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:09,393 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:09,397 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:09,397 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:09,397 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:09" (1/2) ... [2025-04-26 18:40:09,399 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bd3ca37 and model type chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:09, skipping insertion in model container [2025-04-26 18:40:09,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:09,399 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:09" (2/2) ... [2025-04-26 18:40:09,400 INFO L376 chiAutomizerObserver]: Analyzing ICFG chromosome-subst.wvr.bpl [2025-04-26 18:40:09,443 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:40:09,481 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:09,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:09,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:09,484 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:09,485 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:09,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 18:40:09,553 INFO L116 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-04-26 18:40:09,557 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:40:09,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 18:40:09,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 18:40:09,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-04-26 18:40:09,564 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 22 transitions, 62 flow [2025-04-26 18:40:09,564 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 22 transitions, 62 flow [2025-04-26 18:40:09,583 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 110 states, 108 states have (on average 2.8703703703703702) internal successors, (in total 310), 109 states have internal predecessors, (310), 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:09,584 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 110 states, 108 states have (on average 2.8703703703703702) internal successors, (in total 310), 109 states have internal predecessors, (310), 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:09,585 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:09,615 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 95#[thread1EXIT, L101, L59]true [2025-04-26 18:40:09,625 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 209#[thread2EXIT, L83, thread1EXIT, L102]true [2025-04-26 18:40:09,626 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 227#[thread2EXIT, L83, L103]true [2025-04-26 18:40:09,626 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 151#[L59, L83, thread1EXIT, L102]true [2025-04-26 18:40:09,628 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 183#[thread2FINAL, L83, thread1EXIT, L102]true [2025-04-26 18:40:09,628 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 211#[L103, L83, thread2FINAL]true [2025-04-26 18:40:09,629 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179#[L59, thread3FINAL, thread1EXIT, L102]true [2025-04-26 18:40:09,629 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 201#[L59, thread3EXIT, thread1EXIT, L102]true [2025-04-26 18:40:09,630 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 207#[thread3FINAL, L103, L59]true [2025-04-26 18:40:09,631 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 185#[L103, L83, L59]true [2025-04-26 18:40:09,631 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 39#[L100, L35]true [2025-04-26 18:40:09,631 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 69#[thread1FINAL, L101, L59]true [2025-04-26 18:40:09,632 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 115#[L59, thread1FINAL, L83, L102]true [2025-04-26 18:40:09,633 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 149#[thread1FINAL, L83, thread2FINAL, L102]true [2025-04-26 18:40:09,633 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 145#[L59, thread3FINAL, thread1FINAL, L102]true [2025-04-26 18:40:09,633 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 173#[L59, thread1FINAL, thread3EXIT, L102]true [2025-04-26 18:40:09,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 51#[L59, L101, L35]true [2025-04-26 18:40:09,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 67#[thread2FINAL, L101, L35]true [2025-04-26 18:40:09,635 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 91#[thread2EXIT, L101, L35]true [2025-04-26 18:40:09,636 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 181#[thread1FINAL, L83, thread2EXIT, L102]true [2025-04-26 18:40:09,636 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 147#[thread2EXIT, L83, L35, L102]true [2025-04-26 18:40:09,636 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 175#[thread3FINAL, thread2EXIT, L35, L102]true [2025-04-26 18:40:09,637 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 113#[thread2FINAL, L35, L83, L102]true [2025-04-26 18:40:09,637 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 143#[thread3FINAL, thread2FINAL, L35, L102]true [2025-04-26 18:40:09,638 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 171#[thread2FINAL, L35, thread3EXIT, L102]true [2025-04-26 18:40:09,642 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 85#[L59, L83, L35, L102]true [2025-04-26 18:40:09,642 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 111#[L59, thread3FINAL, L35, L102]true [2025-04-26 18:40:09,643 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141#[L59, thread3EXIT, L35, L102]true [2025-04-26 18:40:09,643 WARN L140 AmpleReduction]: Number of pruned transitions: 45 [2025-04-26 18:40:09,643 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 28 [2025-04-26 18:40:09,643 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 28 [2025-04-26 18:40:09,643 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:16 [2025-04-26 18:40:09,643 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:49 [2025-04-26 18:40:09,643 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:40:09,643 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:40:09,643 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:09,644 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:09,649 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:09,649 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:09,649 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:09,649 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:09,649 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:09,649 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:09,649 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:09,649 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:09,651 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:09,660 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2025-04-26 18:40:09,661 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:09,661 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:09,666 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:09,666 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:09,666 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:09,666 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:09,671 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2025-04-26 18:40:09,671 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:09,671 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:09,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:09,671 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:09,675 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L35: Formula: (and (not v_isNull_1_3) (or (and (not v_break_6_8) (not v_isNull_3_5)) (and v_break_6_8 v_isNull_3_5)) (= v_result_7_11 1) (= v_i_8_11 0)) InVars {isNull_1=v_isNull_1_3, isNull_3=v_isNull_3_5} OutVars{isNull_1=v_isNull_1_3, isNull_3=v_isNull_3_5, i_8=v_i_8_11, result_7=v_result_7_11, break_6=v_break_6_8} AuxVars[] AssignedVars[result_7, break_6, i_8]" [2025-04-26 18:40:09,675 INFO L754 eck$LassoCheckResult]: Loop: "[106] L35-->L35: Formula: (and (let ((.cse0 (= v_result_7_23 0))) (or (and (not v_break_6_18) .cse0) (and (not .cse0) v_break_6_18))) (< v_i_8_28 5) (= (select v_o_0_7 v_i_8_28) (+ v_result_7_23 (select v_o_2_7 v_i_8_28))) (= v_i_8_27 (+ v_i_8_28 1)) (not v_break_6_19)) InVars {o_0=v_o_0_7, o_2=v_o_2_7, i_8=v_i_8_28, break_6=v_break_6_19} OutVars{o_0=v_o_0_7, o_2=v_o_2_7, i_8=v_i_8_27, break_6=v_break_6_18, result_7=v_result_7_23} AuxVars[] AssignedVars[break_6, result_7, i_8]" [2025-04-26 18:40:09,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:09,679 INFO L85 PathProgramCache]: Analyzing trace with hash 4723, now seen corresponding path program 1 times [2025-04-26 18:40:09,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:09,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574398869] [2025-04-26 18:40:09,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:09,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:09,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:09,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:09,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:09,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:09,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:09,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:09,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:09,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:09,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:09,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:09,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:09,755 INFO L85 PathProgramCache]: Analyzing trace with hash 137, now seen corresponding path program 1 times [2025-04-26 18:40:09,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:09,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681970366] [2025-04-26 18:40:09,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:09,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:09,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:09,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:09,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:09,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:09,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:09,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:09,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:09,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:09,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:09,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:09,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:09,798 INFO L85 PathProgramCache]: Analyzing trace with hash 146519, now seen corresponding path program 1 times [2025-04-26 18:40:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:09,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83346931] [2025-04-26 18:40:09,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:09,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:09,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:09,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:09,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:09,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:09,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:09,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:09,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:09,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:09,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:09,992 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:09,993 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:09,993 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:09,993 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:09,993 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:09,993 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:09,993 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:09,993 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:09,993 INFO L132 ssoRankerPreferences]: Filename of dumped script: chromosome-subst.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:09,994 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:09,994 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:10,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:10,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:10,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:10,266 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:10,268 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:10,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:10,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:10,272 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:10,273 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:10,274 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:10,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:10,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:10,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:10,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:10,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:10,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:10,296 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:10,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:40:10,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:10,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:10,305 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:10,307 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:10,308 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:10,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:10,319 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:40:10,319 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:40:10,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:10,353 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2025-04-26 18:40:10,353 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:40:10,387 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:10,394 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:10,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:10,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:10,396 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:10,397 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:10,399 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:10,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:10,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:10,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:10,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:10,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:10,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:10,415 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:10,425 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:40:10,425 INFO L437 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 18:40:10,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:10,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:10,430 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:10,431 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:10,432 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:10,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:10,450 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:10,450 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:10,451 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_8) = -2*i_8 + 9 Supporting invariants [] [2025-04-26 18:40:10,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:40:10,459 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:10,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:10,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:10,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:10,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:10,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:10,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:10,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:10,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:10,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:10,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:10,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:10,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:10,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:10,510 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:10,526 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:10,527 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:10,591 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 167 states and 409 transitions. Complement of second has 5 states. [2025-04-26 18:40:10,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-04-26 18:40:10,601 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 18:40:10,602 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:10,602 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 18:40:10,602 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:10,602 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:40:10,602 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:10,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 409 transitions. [2025-04-26 18:40:10,608 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2025-04-26 18:40:10,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 83 states and 205 transitions. [2025-04-26 18:40:10,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-04-26 18:40:10,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 18:40:10,614 INFO L74 IsDeterministic]: Start isDeterministic. Operand 83 states and 205 transitions. [2025-04-26 18:40:10,614 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:10,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 205 transitions. [2025-04-26 18:40:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 205 transitions. [2025-04-26 18:40:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2025-04-26 18:40:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.5625) internal successors, (in total 164), 63 states have internal predecessors, (164), 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:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 164 transitions. [2025-04-26 18:40:10,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 164 transitions. [2025-04-26 18:40:10,639 INFO L438 stractBuchiCegarLoop]: Abstraction has 64 states and 164 transitions. [2025-04-26 18:40:10,639 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:10,639 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 164 transitions. [2025-04-26 18:40:10,640 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2025-04-26 18:40:10,640 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:10,640 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:10,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:40:10,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:10,642 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L35: Formula: (and (not v_isNull_1_3) (or (and (not v_break_6_8) (not v_isNull_3_5)) (and v_break_6_8 v_isNull_3_5)) (= v_result_7_11 1) (= v_i_8_11 0)) InVars {isNull_1=v_isNull_1_3, isNull_3=v_isNull_3_5} OutVars{isNull_1=v_isNull_1_3, isNull_3=v_isNull_3_5, i_8=v_i_8_11, result_7=v_result_7_11, break_6=v_break_6_8} AuxVars[] AssignedVars[result_7, break_6, i_8]" "[121] L100-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[108] $Ultimate##0-->L59: Formula: (and (= v_result_10_19 1) (or (and (not v_break_9_18) (not v_isNull_5_5)) (and v_break_9_18 v_isNull_5_5)) (= v_i_11_27 0) (not v_isNull_1_5)) InVars {isNull_5=v_isNull_5_5, isNull_1=v_isNull_1_5} OutVars{isNull_5=v_isNull_5_5, i_11=v_i_11_27, break_9=v_break_9_18, isNull_1=v_isNull_1_5, result_10=v_result_10_19} AuxVars[] AssignedVars[break_9, i_11, result_10]" [2025-04-26 18:40:10,642 INFO L754 eck$LassoCheckResult]: Loop: "[109] L59-->L59: Formula: (and (< v_i_11_20 5) (= (+ v_result_10_13 (select v_o_4_7 v_i_11_20)) (select v_o_0_13 v_i_11_20)) (let ((.cse0 (= v_result_10_13 0))) (or (and (not v_break_9_12) .cse0) (and (not .cse0) v_break_9_12))) (= (+ v_i_11_20 1) v_i_11_19) (not v_break_9_13)) InVars {i_11=v_i_11_20, o_0=v_o_0_13, break_9=v_break_9_13, o_4=v_o_4_7} OutVars{i_11=v_i_11_19, o_0=v_o_0_13, break_9=v_break_9_12, result_10=v_result_10_13, o_4=v_o_4_7} AuxVars[] AssignedVars[break_9, i_11, result_10]" [2025-04-26 18:40:10,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:10,642 INFO L85 PathProgramCache]: Analyzing trace with hash 4542662, now seen corresponding path program 1 times [2025-04-26 18:40:10,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:10,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137806423] [2025-04-26 18:40:10,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:10,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:10,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:10,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:10,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:10,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:10,650 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:10,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:10,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:10,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:10,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:10,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:10,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash 140, now seen corresponding path program 1 times [2025-04-26 18:40:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:10,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048381196] [2025-04-26 18:40:10,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:10,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:10,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:10,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:10,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:10,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:10,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:10,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:10,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:10,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:10,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:10,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:10,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash 140822631, now seen corresponding path program 1 times [2025-04-26 18:40:10,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:10,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742457241] [2025-04-26 18:40:10,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:10,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:10,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:10,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:10,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:10,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:10,671 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:10,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:10,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:10,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:10,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:10,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:10,852 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:10,852 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:10,852 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:10,852 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:10,852 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:10,852 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:10,852 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:10,852 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:10,853 INFO L132 ssoRankerPreferences]: Filename of dumped script: chromosome-subst.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:40:10,853 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:10,853 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:10,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:10,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:10,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:10,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:10,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:10,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:10,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:10,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,098 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:11,099 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:11,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:11,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:11,103 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:11,104 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:11,105 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:11,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:11,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:11,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:11,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:11,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:11,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:11,120 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:11,126 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:11,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:11,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:11,128 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:11,129 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:11,131 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:11,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:11,141 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:40:11,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:11,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:11,143 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:40:11,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:11,148 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:11,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:11,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:11,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:11,156 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:11,174 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:11,179 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:11,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:11,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:11,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:11,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:11,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:11,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:11,189 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:11,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:11,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:11,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:11,199 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:11,205 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:11,206 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:11,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:11,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:11,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:11,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:11,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:11,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:11,221 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:11,227 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:11,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:11,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:11,229 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:11,231 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:11,232 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:11,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:11,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:11,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:11,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:11,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:11,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:11,247 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:11,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:11,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:11,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:11,256 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:11,257 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:11,259 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:11,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:11,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:11,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:11,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:11,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:11,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:11,274 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:11,279 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:40:11,279 INFO L437 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 18:40:11,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:11,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:11,281 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:11,282 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:11,283 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:11,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:11,301 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:11,301 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:11,301 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_11) = -2*i_11 + 9 Supporting invariants [] [2025-04-26 18:40:11,309 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:11,310 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:11,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:11,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:11,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:11,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:11,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:11,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:11,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:11,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:11,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:11,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:11,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:11,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:11,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:11,341 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:11,342 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:11,342 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 164 transitions. cyclomatic complexity: 133 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:11,385 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 164 transitions. cyclomatic complexity: 133. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 177 states and 468 transitions. Complement of second has 4 states. [2025-04-26 18:40:11,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-26 18:40:11,386 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 18:40:11,386 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:11,386 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 18:40:11,386 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:11,386 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:40:11,386 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:11,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 468 transitions. [2025-04-26 18:40:11,391 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 18:40:11,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 91 states and 232 transitions. [2025-04-26 18:40:11,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-04-26 18:40:11,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 18:40:11,392 INFO L74 IsDeterministic]: Start isDeterministic. Operand 91 states and 232 transitions. [2025-04-26 18:40:11,392 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:11,392 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 232 transitions. [2025-04-26 18:40:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 232 transitions. [2025-04-26 18:40:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2025-04-26 18:40:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 2.675324675324675) internal successors, (in total 206), 76 states have internal predecessors, (206), 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:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 206 transitions. [2025-04-26 18:40:11,400 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 206 transitions. [2025-04-26 18:40:11,400 INFO L438 stractBuchiCegarLoop]: Abstraction has 77 states and 206 transitions. [2025-04-26 18:40:11,400 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:11,400 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 206 transitions. [2025-04-26 18:40:11,401 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 18:40:11,401 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:11,401 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:11,401 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:40:11,401 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:11,402 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L35: Formula: (and (not v_isNull_1_3) (or (and (not v_break_6_8) (not v_isNull_3_5)) (and v_break_6_8 v_isNull_3_5)) (= v_result_7_11 1) (= v_i_8_11 0)) InVars {isNull_1=v_isNull_1_3, isNull_3=v_isNull_3_5} OutVars{isNull_1=v_isNull_1_3, isNull_3=v_isNull_3_5, i_8=v_i_8_11, result_7=v_result_7_11, break_6=v_break_6_8} AuxVars[] AssignedVars[result_7, break_6, i_8]" "[121] L100-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[108] $Ultimate##0-->L59: Formula: (and (= v_result_10_19 1) (or (and (not v_break_9_18) (not v_isNull_5_5)) (and v_break_9_18 v_isNull_5_5)) (= v_i_11_27 0) (not v_isNull_1_5)) InVars {isNull_5=v_isNull_5_5, isNull_1=v_isNull_1_5} OutVars{isNull_5=v_isNull_5_5, i_11=v_i_11_27, break_9=v_break_9_18, isNull_1=v_isNull_1_5, result_10=v_result_10_19} AuxVars[] AssignedVars[break_9, i_11, result_10]" "[124] L101-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[112] $Ultimate##0-->L83: Formula: (and (= v_result_13_23 1) (not v_isNull_3_7) (or (and (not v_break_12_20) (not v_isNull_5_9)) (and v_isNull_5_9 v_break_12_20)) (= v_i_14_29 0)) InVars {isNull_5=v_isNull_5_9, isNull_3=v_isNull_3_7} OutVars{isNull_5=v_isNull_5_9, result_13=v_result_13_23, break_12=v_break_12_20, i_14=v_i_14_29, isNull_3=v_isNull_3_7} AuxVars[] AssignedVars[result_13, break_12, i_14]" [2025-04-26 18:40:11,402 INFO L754 eck$LassoCheckResult]: Loop: "[114] L83-->L83: Formula: (and (= (select v_o_2_13 v_i_14_22) (+ v_result_13_17 (select v_o_4_13 v_i_14_22))) (let ((.cse0 (= v_result_13_17 0))) (or (and v_break_12_14 (not .cse0)) (and .cse0 (not v_break_12_14)))) (not v_break_12_15) (< v_i_14_22 5) (= (+ v_i_14_22 1) v_i_14_21)) InVars {break_12=v_break_12_15, i_14=v_i_14_22, o_2=v_o_2_13, o_4=v_o_4_13} OutVars{break_12=v_break_12_14, result_13=v_result_13_17, i_14=v_i_14_21, o_2=v_o_2_13, o_4=v_o_4_13} AuxVars[] AssignedVars[break_12, result_13, i_14]" [2025-04-26 18:40:11,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash 70534842, now seen corresponding path program 1 times [2025-04-26 18:40:11,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:11,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592026006] [2025-04-26 18:40:11,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:11,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:11,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:11,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:11,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:11,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:11,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:11,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:11,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:11,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:11,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:11,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:11,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash 145, now seen corresponding path program 1 times [2025-04-26 18:40:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:11,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819558451] [2025-04-26 18:40:11,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:11,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:11,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:11,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:11,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:11,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:11,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:11,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:11,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:11,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:11,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:11,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:11,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2108387080, now seen corresponding path program 1 times [2025-04-26 18:40:11,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:11,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874121382] [2025-04-26 18:40:11,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:11,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:11,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:11,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:11,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:11,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:11,429 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:11,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:11,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:11,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:11,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:11,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:11,657 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:11,657 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:11,657 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:11,657 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:11,657 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:11,657 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:11,657 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:11,657 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:11,657 INFO L132 ssoRankerPreferences]: Filename of dumped script: chromosome-subst.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:40:11,657 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:11,657 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:11,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:11,897 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:11,898 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:11,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:11,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:11,907 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:11,907 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:11,908 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:11,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:11,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:11,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:11,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:11,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:11,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:11,921 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:11,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:40:11,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:11,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:11,930 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:11,931 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:11,931 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:11,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:11,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:11,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:11,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:11,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:11,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:11,947 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:11,952 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:40:11,952 INFO L437 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:40:11,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:11,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:11,954 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:11,955 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:11,956 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:11,971 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:11,972 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:11,972 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:11,972 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_14) = -2*i_14 + 9 Supporting invariants [] [2025-04-26 18:40:11,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:40:11,978 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:11,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:11,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:11,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:11,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:11,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:11,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:11,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:12,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:12,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:12,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:12,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:12,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:12,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:12,009 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:12,009 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:12,009 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 206 transitions. cyclomatic complexity: 158 Second operand has 2 states, 2 states have (on average 3.5) 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:12,057 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 206 transitions. cyclomatic complexity: 158. Second operand has 2 states, 2 states have (on average 3.5) 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) Result 148 states and 380 transitions. Complement of second has 4 states. [2025-04-26 18:40:12,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) 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:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-04-26 18:40:12,058 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 6 letters. Loop has 1 letters. [2025-04-26 18:40:12,058 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:12,058 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 7 letters. Loop has 1 letters. [2025-04-26 18:40:12,058 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:12,058 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:40:12,059 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:12,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 380 transitions. [2025-04-26 18:40:12,060 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:12,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 0 states and 0 transitions. [2025-04-26 18:40:12,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:12,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:12,060 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:12,060 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:12,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:12,060 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:12,060 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:12,061 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:12,061 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:12,061 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:12,061 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:12,075 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:12,076 INFO L201 PluginConnector]: Adding new model chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:12 BoogieIcfgContainer [2025-04-26 18:40:12,076 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:12,077 INFO L158 Benchmark]: Toolchain (without parser) took 3009.90ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 85.4MB in the beginning and 25.7MB in the end (delta: 59.8MB). Peak memory consumption was 45.9MB. Max. memory is 8.0GB. [2025-04-26 18:40:12,077 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.77ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:12,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.79ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 83.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:12,078 INFO L158 Benchmark]: Boogie Preprocessor took 23.88ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 82.4MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:12,078 INFO L158 Benchmark]: RCFGBuilder took 259.62ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 69.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:40:12,078 INFO L158 Benchmark]: BuchiAutomizer took 2683.30ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 68.9MB in the beginning and 25.7MB in the end (delta: 43.3MB). Peak memory consumption was 29.1MB. Max. memory is 8.0GB. [2025-04-26 18:40:12,079 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.77ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.79ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 83.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.88ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 82.4MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 259.62ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 69.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2683.30ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 68.9MB in the beginning and 25.7MB in the end (delta: 43.3MB). Peak memory consumption was 29.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 33 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 12 mSDtfsCounter, 75 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital74 mio100 ax100 hnf100 lsp69 ukn91 mio100 lsp75 div100 bol134 ite100 ukn100 eq139 hnf96 smp100 dnf300 smp49 tf100 neg100 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 83ms VariablesStem: 3 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 36 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 168, Number of transitions in reduction automaton: 138, Number of states in reduction automaton: 66, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 + -2 * i_8 and consists of 4 locations. One deterministic module has affine ranking function -2 * i_11 + 9 and consists of 3 locations. One deterministic module has affine ranking function 9 + -2 * i_14 and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:40:12,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...