/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-1.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:36,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:36,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:36,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:36,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:36,217 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:36,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:36,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:36,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:36,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:36,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:36,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:36,234 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:36,234 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:36,234 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:36,234 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:36,234 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:36,234 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:36,234 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:36,234 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:36,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:36,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:36,234 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:36,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:36,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:36,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:36,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:36,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:36,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:36,235 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:36,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:36,235 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:36,235 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:36,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:36,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:36,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:36,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:36,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:36,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:36,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:36,236 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:36,236 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:36,236 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:36,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:36,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:36,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:36,445 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:36,446 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:36,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-1.wvr.bpl [2025-04-26 18:40:36,447 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-1.wvr.bpl' [2025-04-26 18:40:36,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:36,469 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:36,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:36,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:36,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:36,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:36" (1/1) ... [2025-04-26 18:40:36,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:36" (1/1) ... [2025-04-26 18:40:36,507 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:36,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:36,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:36,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:36,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:36,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:36" (1/1) ... [2025-04-26 18:40:36,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:36" (1/1) ... [2025-04-26 18:40:36,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:36" (1/1) ... [2025-04-26 18:40:36,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:36" (1/1) ... [2025-04-26 18:40:36,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:36" (1/1) ... [2025-04-26 18:40:36,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:36" (1/1) ... [2025-04-26 18:40:36,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:36" (1/1) ... [2025-04-26 18:40:36,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:36" (1/1) ... [2025-04-26 18:40:36,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:36" (1/1) ... [2025-04-26 18:40:36,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:36,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:36,538 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:36,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:36,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:36" (1/1) ... [2025-04-26 18:40:36,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:36,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:36,562 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:36,566 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:36,585 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:36,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:36,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:36,586 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:36,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:36,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:36,586 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:36,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:36,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:36,586 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:40:36,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:40:36,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:40:36,587 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:36,631 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:36,632 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:36,709 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:36,709 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:36,716 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:36,717 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:40:36,717 INFO L201 PluginConnector]: Adding new model min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:36 BoogieIcfgContainer [2025-04-26 18:40:36,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:36,719 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:36,719 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:36,723 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:36,724 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:36,724 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:36" (1/2) ... [2025-04-26 18:40:36,725 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2077235a and model type min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:36, skipping insertion in model container [2025-04-26 18:40:36,725 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:36,725 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:36" (2/2) ... [2025-04-26 18:40:36,726 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-1.wvr.bpl [2025-04-26 18:40:36,772 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:40:36,811 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:36,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:36,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:36,815 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:36,817 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:36,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 87 flow [2025-04-26 18:40:36,877 INFO L116 PetriNetUnfolderBase]: 2/27 cut-off events. [2025-04-26 18:40:36,878 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:40:36,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 2/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-04-26 18:40:36,881 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 87 flow [2025-04-26 18:40:36,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 27 transitions, 72 flow [2025-04-26 18:40:36,887 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 35 places, 27 transitions, 72 flow [2025-04-26 18:40:36,888 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 27 transitions, 72 flow [2025-04-26 18:40:36,914 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 234 states, 232 states have (on average 2.6767241379310347) internal successors, (in total 621), 233 states have internal predecessors, (621), 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:36,915 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 234 states, 232 states have (on average 2.6767241379310347) internal successors, (in total 621), 233 states have internal predecessors, (621), 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:36,916 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:37,027 WARN L140 AmpleReduction]: Number of pruned transitions: 175 [2025-04-26 18:40:37,027 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:40:37,027 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 16 [2025-04-26 18:40:37,027 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:53 [2025-04-26 18:40:37,027 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:108 [2025-04-26 18:40:37,028 WARN L145 AmpleReduction]: Times succ was already a loop node:21 [2025-04-26 18:40:37,028 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:25 [2025-04-26 18:40:37,028 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:37,028 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 178 states, 176 states have (on average 1.6363636363636365) internal successors, (in total 288), 177 states have internal predecessors, (288), 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:37,034 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:37,035 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:37,035 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:37,035 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:37,035 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:37,035 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:37,035 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:37,035 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:37,037 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 178 states, 176 states have (on average 1.6363636363636365) internal successors, (in total 288), 177 states have internal predecessors, (288), 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:37,051 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 103 [2025-04-26 18:40:37,051 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:37,051 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:37,055 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:40:37,055 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:37,055 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:37,056 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 178 states, 176 states have (on average 1.6363636363636365) internal successors, (in total 288), 177 states have internal predecessors, (288), 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:37,059 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 103 [2025-04-26 18:40:37,059 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:37,059 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:37,059 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:40:37,059 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:37,063 INFO L752 eck$LassoCheckResult]: Stem: "[57] $Ultimate##0-->L51: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 0) (= v_j_6 v_i_6) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)) (= (select v_A_5 0) v_min_4) (= v_max_4 v_min_4))) InVars {A=v_A_5, b2=v_b2_2, b1=v_b1_2, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_4, max=v_max_4} OutVars{A=v_A_5, b2=v_b2_2, b1=v_b1_2, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_4, max=v_max_4} AuxVars[] AssignedVars[]" "[80] L51-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[62] $Ultimate##0-->L23: Formula: (= (select v_A_1 0) v_min_1) InVars {A=v_A_1} OutVars{A=v_A_1, min=v_min_1} AuxVars[] AssignedVars[min]" "[63] L23-->L24-1: Formula: v_b1_1 InVars {} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[b1]" [2025-04-26 18:40:37,063 INFO L754 eck$LassoCheckResult]: Loop: "[65] L24-1-->L25: Formula: (and (< v_i_1 v_N_1) (< 0 v_i_1)) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[67] L25-->L26: Formula: (= v_min_2 (let ((.cse0 (select v_A_2 v_i_2))) (ite (< v_min_3 .cse0) v_min_3 .cse0))) InVars {A=v_A_2, i=v_i_2, min=v_min_3} OutVars{A=v_A_2, i=v_i_2, min=v_min_2} AuxVars[] AssignedVars[min]" "[68] L26-->L24-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" [2025-04-26 18:40:37,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:37,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2700473, now seen corresponding path program 1 times [2025-04-26 18:40:37,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:37,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617900719] [2025-04-26 18:40:37,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:37,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:37,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:37,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:37,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:37,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:37,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:37,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:37,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:37,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:37,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:37,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:37,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:37,144 INFO L85 PathProgramCache]: Analyzing trace with hash 94401, now seen corresponding path program 1 times [2025-04-26 18:40:37,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:37,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417807943] [2025-04-26 18:40:37,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:37,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:37,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:37,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:37,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:37,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:37,158 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:37,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:37,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:37,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:37,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:37,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:37,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1154522871, now seen corresponding path program 1 times [2025-04-26 18:40:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:37,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509331322] [2025-04-26 18:40:37,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:37,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:37,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:37,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:37,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:37,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:37,301 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:37,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:37,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509331322] [2025-04-26 18:40:37,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509331322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:37,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:37,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:40:37,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833460259] [2025-04-26 18:40:37,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:37,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:37,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:40:37,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:40:37,446 INFO L87 Difference]: Start difference. First operand has 178 states, 176 states have (on average 1.6363636363636365) internal successors, (in total 288), 177 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:37,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:37,483 INFO L93 Difference]: Finished difference Result 123 states and 182 transitions. [2025-04-26 18:40:37,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 182 transitions. [2025-04-26 18:40:37,486 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 36 [2025-04-26 18:40:37,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 86 states and 129 transitions. [2025-04-26 18:40:37,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2025-04-26 18:40:37,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2025-04-26 18:40:37,492 INFO L74 IsDeterministic]: Start isDeterministic. Operand 86 states and 129 transitions. [2025-04-26 18:40:37,492 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:37,493 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 129 transitions. [2025-04-26 18:40:37,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 129 transitions. [2025-04-26 18:40:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-04-26 18:40:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.5) internal successors, (in total 129), 85 states have internal predecessors, (129), 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:37,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 129 transitions. [2025-04-26 18:40:37,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 129 transitions. [2025-04-26 18:40:37,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:40:37,515 INFO L438 stractBuchiCegarLoop]: Abstraction has 86 states and 129 transitions. [2025-04-26 18:40:37,515 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:37,515 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 129 transitions. [2025-04-26 18:40:37,516 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 36 [2025-04-26 18:40:37,516 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:37,518 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:37,518 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:37,518 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:37,519 INFO L752 eck$LassoCheckResult]: Stem: "[57] $Ultimate##0-->L51: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 0) (= v_j_6 v_i_6) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)) (= (select v_A_5 0) v_min_4) (= v_max_4 v_min_4))) InVars {A=v_A_5, b2=v_b2_2, b1=v_b1_2, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_4, max=v_max_4} OutVars{A=v_A_5, b2=v_b2_2, b1=v_b1_2, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_4, max=v_max_4} AuxVars[] AssignedVars[]" "[80] L51-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[83] L51-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[69] $Ultimate##0-->L34: Formula: (= (select v_A_4 0) v_max_3) InVars {A=v_A_4} OutVars{A=v_A_4, max=v_max_3} AuxVars[] AssignedVars[max]" "[70] L34-->L35-1: Formula: v_b2_1 InVars {} OutVars{b2=v_b2_1} AuxVars[] AssignedVars[b2]" [2025-04-26 18:40:37,519 INFO L754 eck$LassoCheckResult]: Loop: "[72] L35-1-->L36: Formula: (and (< v_j_1 v_N_3) (< 0 v_j_1)) InVars {N=v_N_3, j=v_j_1} OutVars{N=v_N_3, j=v_j_1} AuxVars[] AssignedVars[]" "[74] L36-->L37: Formula: (= v_max_1 (let ((.cse0 (select v_A_3 v_j_2))) (ite (< .cse0 v_max_2) v_max_2 .cse0))) InVars {A=v_A_3, max=v_max_2, j=v_j_2} OutVars{A=v_A_3, max=v_max_1, j=v_j_2} AuxVars[] AssignedVars[max]" "[75] L37-->L35-1: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j]" [2025-04-26 18:40:37,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:37,519 INFO L85 PathProgramCache]: Analyzing trace with hash 83735100, now seen corresponding path program 1 times [2025-04-26 18:40:37,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:37,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166975394] [2025-04-26 18:40:37,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:37,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:37,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:37,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:37,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:37,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:37,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:37,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:37,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:37,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:37,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:37,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:37,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash 101352, now seen corresponding path program 1 times [2025-04-26 18:40:37,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:37,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311420144] [2025-04-26 18:40:37,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:37,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:37,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:37,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:37,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:37,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:37,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:37,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:37,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:37,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:37,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:37,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash -823563315, now seen corresponding path program 1 times [2025-04-26 18:40:37,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:37,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051895299] [2025-04-26 18:40:37,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:37,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:37,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:37,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:37,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:37,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:37,606 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:37,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:37,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051895299] [2025-04-26 18:40:37,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051895299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:37,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:37,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:40:37,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631877566] [2025-04-26 18:40:37,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:37,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:37,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:40:37,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:40:37,658 INFO L87 Difference]: Start difference. First operand 86 states and 129 transitions. cyclomatic complexity: 55 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:37,663 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2025-04-26 18:40:37,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 67 transitions. [2025-04-26 18:40:37,664 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:37,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 0 states and 0 transitions. [2025-04-26 18:40:37,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:37,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:37,664 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:37,664 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:37,664 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:37,664 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:37,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:40:37,665 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:37,665 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:37,665 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:37,665 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:37,665 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:37,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:37,676 INFO L201 PluginConnector]: Adding new model min-max-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:37 BoogieIcfgContainer [2025-04-26 18:40:37,676 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:37,677 INFO L158 Benchmark]: Toolchain (without parser) took 1207.51ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 96.4MB in the end (delta: -11.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:37,677 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:37,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.23ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 83.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:37,677 INFO L158 Benchmark]: Boogie Preprocessor took 26.59ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.1MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:37,677 INFO L158 Benchmark]: RCFGBuilder took 180.14ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 71.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:37,678 INFO L158 Benchmark]: BuchiAutomizer took 957.05ms. Allocated memory is still 155.2MB. Free memory was 71.5MB in the beginning and 96.4MB in the end (delta: -24.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:37,679 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.17ms. Allocated memory is still 155.2MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.23ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 83.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.59ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.1MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 180.14ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 71.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 957.05ms. Allocated memory is still 155.2MB. Free memory was 71.5MB in the beginning and 96.4MB in the end (delta: -24.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 24 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 221, Number of transitions in reduction automaton: 288, Number of states in reduction automaton: 178, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic). 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:40:37,693 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...