/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/array-int-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:03,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:03,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:03,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:03,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:03,196 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:03,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:03,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:03,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:03,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:03,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:03,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:03,220 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:03,220 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:03,221 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:03,221 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:03,221 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:03,221 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:03,221 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:03,221 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:03,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:03,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:03,221 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:03,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:03,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:03,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:03,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:03,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:03,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:03,222 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:03,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:03,222 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:03,222 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:03,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:03,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:03,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:03,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:03,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:03,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:03,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:03,223 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:03,223 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:03,223 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:03,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:03,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:03,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:03,474 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:03,474 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:03,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-symm.wvr.bpl [2025-04-26 18:40:03,477 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-symm.wvr.bpl' [2025-04-26 18:40:03,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:03,499 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:03,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:03,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:03,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:03,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:03" (1/1) ... [2025-04-26 18:40:03,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:03" (1/1) ... [2025-04-26 18:40:03,540 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:03,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:03,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:03,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:03,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:03,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:03" (1/1) ... [2025-04-26 18:40:03,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:03" (1/1) ... [2025-04-26 18:40:03,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:03" (1/1) ... [2025-04-26 18:40:03,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:03" (1/1) ... [2025-04-26 18:40:03,552 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:03" (1/1) ... [2025-04-26 18:40:03,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:03" (1/1) ... [2025-04-26 18:40:03,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:03" (1/1) ... [2025-04-26 18:40:03,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:03" (1/1) ... [2025-04-26 18:40:03,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:03" (1/1) ... [2025-04-26 18:40:03,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:03,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:03,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:03,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:03,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:03" (1/1) ... [2025-04-26 18:40:03,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:03,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,592 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:03,598 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:03,616 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:03,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:03,617 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:03,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:03,617 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:03,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:03,617 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:03,657 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:03,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:03,754 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:03,754 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:03,792 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:03,792 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 18:40:03,792 INFO L201 PluginConnector]: Adding new model array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:03 BoogieIcfgContainer [2025-04-26 18:40:03,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:03,793 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:03,793 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:03,801 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:03,801 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:03,801 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:03" (1/2) ... [2025-04-26 18:40:03,802 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12535c08 and model type array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:03, skipping insertion in model container [2025-04-26 18:40:03,802 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:03,802 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:03" (2/2) ... [2025-04-26 18:40:03,803 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-int-symm.wvr.bpl [2025-04-26 18:40:03,849 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:40:03,890 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:03,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:03,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,893 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:03,895 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:03,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 18:40:03,966 INFO L116 PetriNetUnfolderBase]: 2/16 cut-off events. [2025-04-26 18:40:03,971 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:40:03,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 2/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-26 18:40:03,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 18:40:03,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 44 flow [2025-04-26 18:40:03,979 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 21 places, 16 transitions, 44 flow [2025-04-26 18:40:03,979 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 21 places, 16 transitions, 44 flow [2025-04-26 18:40:03,989 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 30 states, 28 states have (on average 1.9285714285714286) internal successors, (in total 54), 29 states have internal predecessors, (54), 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:03,989 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 30 states, 28 states have (on average 1.9285714285714286) internal successors, (in total 54), 29 states have internal predecessors, (54), 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:03,993 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:04,019 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 56#[thread1EXIT, L48, L62]true [2025-04-26 18:40:04,021 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 32#[L61, L29]true [2025-04-26 18:40:04,022 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 48#[L48, thread1FINAL, L62]true [2025-04-26 18:40:04,023 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 40#[L48, L62, L29]true [2025-04-26 18:40:04,023 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 50#[thread2FINAL, L29, L62]true [2025-04-26 18:40:04,023 WARN L140 AmpleReduction]: Number of pruned transitions: 8 [2025-04-26 18:40:04,023 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 5 [2025-04-26 18:40:04,023 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 5 [2025-04-26 18:40:04,024 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:12 [2025-04-26 18:40:04,024 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:11 [2025-04-26 18:40:04,024 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:40:04,024 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:40:04,024 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:04,025 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (in total 35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:04,030 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:04,031 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:04,031 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:04,031 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:04,031 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:04,031 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:04,031 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:04,031 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:04,033 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (in total 35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:04,041 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2025-04-26 18:40:04,041 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:04,041 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:04,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:04,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:04,044 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:04,044 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (in total 35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:04,045 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2025-04-26 18:40:04,045 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:04,045 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:04,045 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:04,045 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:04,049 INFO L752 eck$LassoCheckResult]: Stem: "[70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[60] $Ultimate##0-->L29: Formula: (and (= v_i_4_18 0) (not v_break_5_15) (= v_len_1_11 (+ v_result_6_19 v_len_3_11))) InVars {len_1=v_len_1_11, len_3=v_len_3_11} OutVars{break_5=v_break_5_15, i_4=v_i_4_18, len_1=v_len_1_11, result_6=v_result_6_19, len_3=v_len_3_11} AuxVars[] AssignedVars[break_5, i_4, result_6]" [2025-04-26 18:40:04,049 INFO L754 eck$LassoCheckResult]: Loop: "[62] L29-->L29: Formula: (let ((.cse2 (select v_array_2_9 v_i_4_14)) (.cse1 (select v_array_0_9 v_i_4_14))) (let ((.cse0 (= .cse2 .cse1))) (and (< v_i_4_15 v_len_1_7) (or (and (not v_break_5_9) .cse0) (and v_break_5_9 (not .cse0))) (< v_i_4_15 v_len_3_7) (= v_result_6_13 (ite .cse0 v_result_6_14 (+ .cse1 (* (- 1) .cse2)))) (not v_break_5_10) (= (+ v_i_4_15 1) v_i_4_14)))) InVars {break_5=v_break_5_10, i_4=v_i_4_15, len_1=v_len_1_7, array_2=v_array_2_9, result_6=v_result_6_14, len_3=v_len_3_7, array_0=v_array_0_9} OutVars{break_5=v_break_5_9, i_4=v_i_4_14, len_1=v_len_1_7, array_2=v_array_2_9, result_6=v_result_6_13, len_3=v_len_3_7, array_0=v_array_0_9} AuxVars[] AssignedVars[break_5, i_4, result_6]" [2025-04-26 18:40:04,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash 3191, now seen corresponding path program 1 times [2025-04-26 18:40:04,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:04,057 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923355876] [2025-04-26 18:40:04,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:04,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:04,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:04,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:04,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,106 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:04,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:04,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:04,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:04,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 1 times [2025-04-26 18:40:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:04,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876035853] [2025-04-26 18:40:04,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:04,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:04,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:04,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:04,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:04,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:04,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:04,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:04,151 INFO L85 PathProgramCache]: Analyzing trace with hash 98983, now seen corresponding path program 1 times [2025-04-26 18:40:04,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:04,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215611026] [2025-04-26 18:40:04,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:04,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:04,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:04,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:04,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:04,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:04,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:04,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:04,413 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:04,413 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:04,413 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:04,413 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:04,413 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:04,413 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:04,414 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:04,414 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:04,414 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-int-symm.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:04,414 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:04,414 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:04,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:04,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:04,758 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:04,761 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:04,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:04,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:04,765 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:04,766 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:04,768 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:04,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:04,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:04,780 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:40:04,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:04,816 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 18:40:04,816 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:40:04,875 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:04,917 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 18:40:04,917 INFO L437 ModelExtractionUtils]: 47 out of 57 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:40:04,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:04,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:04,921 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:04,922 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:04,923 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:04,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:40:04,945 INFO L439 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-04-26 18:40:04,946 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:04,946 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_4, len_1) = -1*i_4 + 1*len_1 Supporting invariants [] [2025-04-26 18:40:04,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:04,956 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:04,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:04,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:04,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:04,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:04,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:04,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:04,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:04,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:04,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:04,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:04,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:05,000 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:05,019 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:05,021 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (in total 35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) 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:05,077 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (in total 35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). 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 53 states and 92 transitions. Complement of second has 5 states. [2025-04-26 18:40:05,079 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:05,082 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:05,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-04-26 18:40:05,086 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 18:40:05,088 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:05,088 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 18:40:05,088 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:05,088 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:40:05,088 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:05,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 92 transitions. [2025-04-26 18:40:05,093 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:40:05,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 17 states and 30 transitions. [2025-04-26 18:40:05,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-04-26 18:40:05,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-04-26 18:40:05,098 INFO L74 IsDeterministic]: Start isDeterministic. Operand 17 states and 30 transitions. [2025-04-26 18:40:05,098 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:05,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 30 transitions. [2025-04-26 18:40:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 30 transitions. [2025-04-26 18:40:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2025-04-26 18:40:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8) internal successors, (in total 27), 14 states have internal predecessors, (27), 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:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2025-04-26 18:40:05,116 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 27 transitions. [2025-04-26 18:40:05,116 INFO L438 stractBuchiCegarLoop]: Abstraction has 15 states and 27 transitions. [2025-04-26 18:40:05,116 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:05,116 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 27 transitions. [2025-04-26 18:40:05,117 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:40:05,117 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:05,117 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:05,117 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:40:05,117 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:05,119 INFO L752 eck$LassoCheckResult]: Stem: "[70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[60] $Ultimate##0-->L29: Formula: (and (= v_i_4_18 0) (not v_break_5_15) (= v_len_1_11 (+ v_result_6_19 v_len_3_11))) InVars {len_1=v_len_1_11, len_3=v_len_3_11} OutVars{break_5=v_break_5_15, i_4=v_i_4_18, len_1=v_len_1_11, result_6=v_result_6_19, len_3=v_len_3_11} AuxVars[] AssignedVars[break_5, i_4, result_6]" "[73] L61-->$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]" "[64] $Ultimate##0-->L48: Formula: (and (= (+ v_result_9_19 v_len_1_17) v_len_3_17) (not v_break_8_15) (= v_i_7_18 0)) InVars {len_1=v_len_1_17, len_3=v_len_3_17} OutVars{result_9=v_result_9_19, i_7=v_i_7_18, len_1=v_len_1_17, break_8=v_break_8_15, len_3=v_len_3_17} AuxVars[] AssignedVars[result_9, i_7, break_8]" [2025-04-26 18:40:05,119 INFO L754 eck$LassoCheckResult]: Loop: "[66] L48-->L48: Formula: (let ((.cse1 (select v_array_2_15 v_i_7_14)) (.cse2 (select v_array_0_15 v_i_7_14))) (let ((.cse0 (= .cse1 .cse2))) (and (< v_i_7_15 v_len_3_13) (= v_result_9_13 (ite .cse0 v_result_9_14 (+ .cse1 (* (- 1) .cse2)))) (= (+ v_i_7_15 1) v_i_7_14) (< v_i_7_15 v_len_1_13) (or (and (not v_break_8_9) .cse0) (and (not .cse0) v_break_8_9)) (not v_break_8_10)))) InVars {result_9=v_result_9_14, i_7=v_i_7_15, len_1=v_len_1_13, array_2=v_array_2_15, break_8=v_break_8_10, len_3=v_len_3_13, array_0=v_array_0_15} OutVars{result_9=v_result_9_13, i_7=v_i_7_14, len_1=v_len_1_13, array_2=v_array_2_15, break_8=v_break_8_9, len_3=v_len_3_13, array_0=v_array_0_15} AuxVars[] AssignedVars[result_9, i_7, break_8]" [2025-04-26 18:40:05,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,119 INFO L85 PathProgramCache]: Analyzing trace with hash 3068878, now seen corresponding path program 1 times [2025-04-26 18:40:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:05,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947742081] [2025-04-26 18:40:05,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:05,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:05,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:05,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:05,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,127 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:05,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:05,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:05,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:05,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash 97, now seen corresponding path program 1 times [2025-04-26 18:40:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:05,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986814366] [2025-04-26 18:40:05,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:05,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:05,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:05,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:05,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,139 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:05,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:05,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:05,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:05,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash 95135284, now seen corresponding path program 1 times [2025-04-26 18:40:05,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:05,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739950462] [2025-04-26 18:40:05,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:05,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:05,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:05,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:05,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:05,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:05,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:05,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:05,322 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:05,323 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:05,323 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:05,323 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:05,323 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:05,323 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,323 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:05,323 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:05,323 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-int-symm.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:40:05,323 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:05,323 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:05,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,586 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:05,587 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:05,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,589 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:05,590 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:05,591 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:05,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:05,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:05,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:05,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:05,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:05,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:05,606 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:05,612 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:05,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,614 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:05,615 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:05,616 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:05,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:05,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:05,627 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:40:05,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:05,652 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 18:40:05,653 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:40:05,712 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:05,754 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 18:40:05,754 INFO L437 ModelExtractionUtils]: 54 out of 64 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:40:05,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,757 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:05,758 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:05,758 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:05,780 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:05,780 INFO L439 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-04-26 18:40:05,780 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:05,781 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_7, len_1) = -1*i_7 + 1*len_1 Supporting invariants [] [2025-04-26 18:40:05,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:40:05,789 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:05,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:05,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:05,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:05,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:05,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:05,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:05,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:05,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:05,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:05,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:05,824 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:05,824 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:05,824 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 27 transitions. cyclomatic complexity: 18 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:05,842 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 27 transitions. cyclomatic complexity: 18. 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 24 states and 41 transitions. Complement of second has 4 states. [2025-04-26 18:40:05,842 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:05,843 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:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-04-26 18:40:05,843 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 18:40:05,843 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:05,843 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 18:40:05,843 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:05,843 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:40:05,843 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:05,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 41 transitions. [2025-04-26 18:40:05,844 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:05,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2025-04-26 18:40:05,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:05,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:05,844 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:05,844 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:05,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:05,844 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:05,844 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:05,844 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:05,844 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:05,844 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:05,844 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:05,855 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:05,856 INFO L201 PluginConnector]: Adding new model array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:05 BoogieIcfgContainer [2025-04-26 18:40:05,856 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:05,857 INFO L158 Benchmark]: Toolchain (without parser) took 2357.52ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 85.9MB in the beginning and 111.2MB in the end (delta: -25.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:05,857 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.75ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:05,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.40ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:05,857 INFO L158 Benchmark]: Boogie Preprocessor took 22.93ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 83.1MB in the end (delta: 929.7kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:05,858 INFO L158 Benchmark]: RCFGBuilder took 227.21ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 71.8MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:05,858 INFO L158 Benchmark]: BuchiAutomizer took 2062.88ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 71.6MB in the beginning and 111.2MB in the end (delta: -39.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:05,859 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.75ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.40ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.93ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 83.1MB in the end (delta: 929.7kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 227.21ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 71.8MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2062.88ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 71.6MB in the beginning and 111.2MB in the end (delta: -39.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 6 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital91 mio100 ax100 hnf100 lsp103 ukn64 mio100 lsp100 div100 bol108 ite100 ukn100 eq168 hnf96 smp100 dnf240 smp56 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 184ms VariablesStem: 5 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 138, Number of transitions in reduction automaton: 35, Number of states in reduction automaton: 24, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i_4 + len_1 and consists of 4 locations. One deterministic module has affine ranking function len_1 + -1 * i_7 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:05,870 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...