/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/regression/TwoActiveWorkersSirius.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:52:42,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:52:42,715 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:52:42,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:52:42,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:52:42,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:52:42,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:52:42,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:52:42,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:52:42,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:52:42,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:52:42,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:52:42,744 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:52:42,744 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:52:42,744 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:52:42,744 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:52:42,744 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:52:42,744 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:52:42,744 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:52:42,744 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:52:42,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:52:42,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:52:42,744 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:52:42,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:52:42,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:52:42,745 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:52:42,746 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:52:42,746 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:52:42,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:52:42,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:52:42,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:52:42,964 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:52:42,965 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:52:42,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/TwoActiveWorkersSirius.bpl [2025-04-26 16:52:42,966 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/TwoActiveWorkersSirius.bpl' [2025-04-26 16:52:42,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:52:42,981 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:52:42,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:52:42,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:52:42,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:52:42,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:42" (1/1) ... [2025-04-26 16:52:43,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:42" (1/1) ... [2025-04-26 16:52:43,015 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:52:43,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:52:43,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:52:43,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:52:43,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:52:43,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:42" (1/1) ... [2025-04-26 16:52:43,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:42" (1/1) ... [2025-04-26 16:52:43,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:42" (1/1) ... [2025-04-26 16:52:43,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:42" (1/1) ... [2025-04-26 16:52:43,023 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:42" (1/1) ... [2025-04-26 16:52:43,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:42" (1/1) ... [2025-04-26 16:52:43,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:42" (1/1) ... [2025-04-26 16:52:43,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:42" (1/1) ... [2025-04-26 16:52:43,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:42" (1/1) ... [2025-04-26 16:52:43,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:52:43,031 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:52:43,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:52:43,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:52:43,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:42" (1/1) ... [2025-04-26 16:52:43,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:52:43,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:43,055 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 16:52:43,060 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 16:52:43,078 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:52:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:52:43,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:52:43,078 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2025-04-26 16:52:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-04-26 16:52:43,078 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-04-26 16:52:43,079 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 16:52:43,109 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:52:43,110 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:52:43,162 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:52:43,162 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:52:43,169 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:52:43,170 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 16:52:43,170 INFO L201 PluginConnector]: Adding new model TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:52:43 BoogieIcfgContainer [2025-04-26 16:52:43,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:52:43,173 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:52:43,173 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:52:43,177 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:52:43,177 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:52:43,178 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:42" (1/2) ... [2025-04-26 16:52:43,178 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bf306c5 and model type TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:52:43, skipping insertion in model container [2025-04-26 16:52:43,179 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:52:43,179 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:52:43" (2/2) ... [2025-04-26 16:52:43,179 INFO L376 chiAutomizerObserver]: Analyzing ICFG TwoActiveWorkersSirius.bpl [2025-04-26 16:52:43,220 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-26 16:52:43,261 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:43,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:43,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:43,263 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 16:52:43,266 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 16:52:43,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 16 transitions, 39 flow [2025-04-26 16:52:43,335 INFO L116 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-04-26 16:52:43,336 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-26 16:52:43,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 19 events. 2/19 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 7. Up to 3 conditions per place. [2025-04-26 16:52:43,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 17 places, 16 transitions, 39 flow [2025-04-26 16:52:43,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 17 places, 16 transitions, 39 flow [2025-04-26 16:52:43,343 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 17 places, 16 transitions, 39 flow [2025-04-26 16:52:43,349 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:43,401 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 96#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerFINAL]true [2025-04-26 16:52:43,416 WARN L140 AmpleReduction]: Number of pruned transitions: 13 [2025-04-26 16:52:43,417 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:52:43,417 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:52:43,417 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:33 [2025-04-26 16:52:43,417 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:11 [2025-04-26 16:52:43,417 WARN L145 AmpleReduction]: Times succ was already a loop node:1 [2025-04-26 16:52:43,417 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:52:43,417 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:43,418 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 45 states, 41 states have (on average 1.6341463414634145) internal successors, (in total 67), 44 states have internal predecessors, (67), 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 16:52:43,423 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:43,423 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:43,424 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:43,424 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:43,424 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:43,424 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:43,424 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:43,424 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:43,425 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 41 states have (on average 1.6341463414634145) internal successors, (in total 67), 44 states have internal predecessors, (67), 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 16:52:43,434 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2025-04-26 16:52:43,434 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:43,434 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:43,437 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:52:43,437 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:43,437 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:43,437 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 41 states have (on average 1.6341463414634145) internal successors, (in total 67), 44 states have internal predecessors, (67), 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 16:52:43,440 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2025-04-26 16:52:43,440 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:43,440 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:43,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:52:43,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:43,444 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[26] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" [2025-04-26 16:52:43,444 INFO L754 eck$LassoCheckResult]: Loop: "[43] L19-1-->$Ultimate##0: Formula: (= v_i_11 v_workerThread1of1ForFork0_thidvar0_2) InVars {i=v_i_11} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, i=v_i_11} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0]" "[33] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[36] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[38] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[39] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[40] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[44] workerEXIT-->L21-2: Formula: (= v_i_13 (+ v_workerThread1of1ForFork0_thidvar0_4 1)) InVars {workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_4, i=v_i_13} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_4, i=v_i_13} AuxVars[] AssignedVars[]" "[32] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" [2025-04-26 16:52:43,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:43,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1948, now seen corresponding path program 1 times [2025-04-26 16:52:43,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:43,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334875640] [2025-04-26 16:52:43,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:43,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:43,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:52:43,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:52:43,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:43,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:43,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:43,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:52:43,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:52:43,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:43,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:43,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:43,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:43,509 INFO L85 PathProgramCache]: Analyzing trace with hash 408741230, now seen corresponding path program 1 times [2025-04-26 16:52:43,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:43,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468749831] [2025-04-26 16:52:43,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:43,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:43,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:43,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:43,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:43,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:43,621 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 16:52:43,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:52:43,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468749831] [2025-04-26 16:52:43,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468749831] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:52:43,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:52:43,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:52:43,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403098103] [2025-04-26 16:52:43,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:52:43,628 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:52:43,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:52:43,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:52:43,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:52:43,668 INFO L87 Difference]: Start difference. First operand has 45 states, 41 states have (on average 1.6341463414634145) internal successors, (in total 67), 44 states have internal predecessors, (67), 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.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 16:52:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:52:43,738 INFO L93 Difference]: Finished difference Result 33 states and 50 transitions. [2025-04-26 16:52:43,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 50 transitions. [2025-04-26 16:52:43,740 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-04-26 16:52:43,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 27 states and 40 transitions. [2025-04-26 16:52:43,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-04-26 16:52:43,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-04-26 16:52:43,749 INFO L74 IsDeterministic]: Start isDeterministic. Operand 27 states and 40 transitions. [2025-04-26 16:52:43,750 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:52:43,750 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 40 transitions. [2025-04-26 16:52:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 40 transitions. [2025-04-26 16:52:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-04-26 16:52:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.4814814814814814) internal successors, (in total 40), 26 states have internal predecessors, (40), 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 16:52:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2025-04-26 16:52:43,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 40 transitions. [2025-04-26 16:52:43,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:52:43,777 INFO L438 stractBuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2025-04-26 16:52:43,777 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:52:43,777 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2025-04-26 16:52:43,778 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-04-26 16:52:43,778 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:43,778 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:43,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:43,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:43,781 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[26] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[43] L19-1-->$Ultimate##0: Formula: (= v_i_11 v_workerThread1of1ForFork0_thidvar0_2) InVars {i=v_i_11} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, i=v_i_11} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0]" "[34] L20-->L21-2: Formula: (<= v_i_3 0) InVars {i=v_i_3} OutVars{i=v_i_3} AuxVars[] AssignedVars[]" "[32] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[36] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[37] L30-->workerErr0ASSERT_VIOLATIONASSERT: Formula: (< (* 2 v_i_7) v_c_4) InVars {i=v_i_7, c=v_c_4} OutVars{i=v_i_7, c=v_c_4} AuxVars[] AssignedVars[]" "[41] L19-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:43,781 INFO L754 eck$LassoCheckResult]: Loop: "[42] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:43,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:43,782 INFO L85 PathProgramCache]: Analyzing trace with hash -751207397, now seen corresponding path program 1 times [2025-04-26 16:52:43,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:43,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978269822] [2025-04-26 16:52:43,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:43,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:43,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:43,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:43,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:43,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:43,856 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 16:52:43,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:52:43,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978269822] [2025-04-26 16:52:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978269822] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:52:43,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:52:43,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:52:43,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495937377] [2025-04-26 16:52:43,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:52:43,857 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:52:43,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:43,858 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 1 times [2025-04-26 16:52:43,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:43,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900891117] [2025-04-26 16:52:43,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:43,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:43,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:43,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:43,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:43,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:43,860 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:43,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:43,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:43,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:43,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:43,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:43,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:52:43,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:52:43,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:52:43,868 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. cyclomatic complexity: 16 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (in total 8), 5 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 16:52:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:52:43,973 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2025-04-26 16:52:43,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 63 transitions. [2025-04-26 16:52:43,974 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-04-26 16:52:43,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 63 transitions. [2025-04-26 16:52:43,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-04-26 16:52:43,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-04-26 16:52:43,975 INFO L74 IsDeterministic]: Start isDeterministic. Operand 41 states and 63 transitions. [2025-04-26 16:52:43,976 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:52:43,976 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 63 transitions. [2025-04-26 16:52:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 63 transitions. [2025-04-26 16:52:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2025-04-26 16:52:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (in total 43), 28 states have internal predecessors, (43), 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 16:52:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2025-04-26 16:52:43,979 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2025-04-26 16:52:43,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 16:52:43,980 INFO L438 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2025-04-26 16:52:43,980 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:52:43,981 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2025-04-26 16:52:43,981 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-04-26 16:52:43,981 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:43,981 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:43,981 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:43,981 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:43,982 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[26] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[43] L19-1-->$Ultimate##0: Formula: (= v_i_11 v_workerThread1of1ForFork0_thidvar0_2) InVars {i=v_i_11} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, i=v_i_11} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0]" "[34] L20-->L21-2: Formula: (<= v_i_3 0) InVars {i=v_i_3} OutVars{i=v_i_3} AuxVars[] AssignedVars[]" "[36] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[32] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[37] L30-->workerErr0ASSERT_VIOLATIONASSERT: Formula: (< (* 2 v_i_7) v_c_4) InVars {i=v_i_7, c=v_c_4} OutVars{i=v_i_7, c=v_c_4} AuxVars[] AssignedVars[]" "[41] L19-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:43,982 INFO L754 eck$LassoCheckResult]: Loop: "[42] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:43,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:43,982 INFO L85 PathProgramCache]: Analyzing trace with hash -751092077, now seen corresponding path program 2 times [2025-04-26 16:52:43,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:43,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936170764] [2025-04-26 16:52:43,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:52:43,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:43,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:43,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:43,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:52:43,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:44,041 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 16:52:44,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:52:44,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936170764] [2025-04-26 16:52:44,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936170764] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:52:44,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:52:44,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:52:44,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397659327] [2025-04-26 16:52:44,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:52:44,042 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:52:44,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:44,042 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 2 times [2025-04-26 16:52:44,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:44,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531967395] [2025-04-26 16:52:44,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:52:44,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:44,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:44,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:44,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:52:44,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,044 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:44,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:44,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:44,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:44,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:52:44,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:52:44,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:52:44,048 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (in total 8), 5 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 16:52:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:52:44,130 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2025-04-26 16:52:44,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 48 transitions. [2025-04-26 16:52:44,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 16:52:44,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 48 transitions. [2025-04-26 16:52:44,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-04-26 16:52:44,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-04-26 16:52:44,131 INFO L74 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2025-04-26 16:52:44,131 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:52:44,131 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 48 transitions. [2025-04-26 16:52:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2025-04-26 16:52:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2025-04-26 16:52:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (in total 32), 22 states have internal predecessors, (32), 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 16:52:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2025-04-26 16:52:44,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-04-26 16:52:44,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 16:52:44,134 INFO L438 stractBuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-04-26 16:52:44,134 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:52:44,134 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2025-04-26 16:52:44,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 16:52:44,135 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:44,135 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:44,135 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:44,135 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:44,135 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[26] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[43] L19-1-->$Ultimate##0: Formula: (= v_i_11 v_workerThread1of1ForFork0_thidvar0_2) InVars {i=v_i_11} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, i=v_i_11} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0]" "[34] L20-->L21-2: Formula: (<= v_i_3 0) InVars {i=v_i_3} OutVars{i=v_i_3} AuxVars[] AssignedVars[]" "[32] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[36] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[38] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[41] L19-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[39] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" [2025-04-26 16:52:44,136 INFO L754 eck$LassoCheckResult]: Loop: "[42] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:44,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:44,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1812591827, now seen corresponding path program 1 times [2025-04-26 16:52:44,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:44,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777518552] [2025-04-26 16:52:44,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:44,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:44,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:52:44,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:52:44,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,146 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:44,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:52:44,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:52:44,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:44,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:44,155 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 3 times [2025-04-26 16:52:44,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:44,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761098686] [2025-04-26 16:52:44,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:52:44,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:44,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:44,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:44,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:52:44,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:44,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:44,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:44,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:44,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:44,159 INFO L85 PathProgramCache]: Analyzing trace with hash -355771747, now seen corresponding path program 1 times [2025-04-26 16:52:44,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:44,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467484284] [2025-04-26 16:52:44,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:44,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:44,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:52:44,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:52:44,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,166 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:44,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:52:44,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:52:44,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:44,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:52:44,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:52:44,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,230 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:44,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:52:44,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:52:44,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,242 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:52:44,250 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:52:44,259 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 16:52:44,259 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:44,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:44,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:44,262 INFO L229 MonitoredProcess]: Starting monitored process 3 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 16:52:44,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2025-04-26 16:52:44,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 23 transitions, 62 flow [2025-04-26 16:52:44,283 INFO L116 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-04-26 16:52:44,284 INFO L117 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-04-26 16:52:44,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 23. Up to 5 conditions per place. [2025-04-26 16:52:44,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 23 transitions, 62 flow [2025-04-26 16:52:44,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 23 transitions, 62 flow [2025-04-26 16:52:44,286 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 25 places, 23 transitions, 62 flow [2025-04-26 16:52:44,286 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:44,340 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 162#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONASSERT, workerFINAL]true [2025-04-26 16:52:44,362 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 268#[workerFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONASSERT]true [2025-04-26 16:52:44,381 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 358#[workerFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerEXIT]true [2025-04-26 16:52:44,402 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 488#[workerEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerFINAL]true [2025-04-26 16:52:44,403 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 490#[workerFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerFINAL]true [2025-04-26 16:52:44,403 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 456#[L30, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L31]true [2025-04-26 16:52:44,418 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 572#[L30, L31, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:52:44,418 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 566#[L30, L30, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:52:44,418 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 548#[L30, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:52:44,430 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 632#[$Ultimate##0, L30, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:52:44,430 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 618#[$Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:52:44,434 WARN L140 AmpleReduction]: Number of pruned transitions: 196 [2025-04-26 16:52:44,434 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 11 [2025-04-26 16:52:44,434 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 11 [2025-04-26 16:52:44,435 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:176 [2025-04-26 16:52:44,435 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:113 [2025-04-26 16:52:44,435 WARN L145 AmpleReduction]: Times succ was already a loop node:16 [2025-04-26 16:52:44,435 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:1 [2025-04-26 16:52:44,435 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:44,435 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 290 states, 279 states have (on average 1.92831541218638) internal successors, (in total 538), 289 states have internal predecessors, (538), 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 16:52:44,436 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:44,436 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:44,436 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:44,436 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:44,436 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:44,436 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:44,436 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:44,436 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:44,436 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 290 states, 279 states have (on average 1.92831541218638) internal successors, (in total 538), 289 states have internal predecessors, (538), 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 16:52:44,442 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 119 [2025-04-26 16:52:44,442 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:44,442 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:44,443 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:52:44,443 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:44,443 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:44,443 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 290 states, 279 states have (on average 1.92831541218638) internal successors, (in total 538), 289 states have internal predecessors, (538), 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 16:52:44,447 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 119 [2025-04-26 16:52:44,447 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:44,447 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:44,447 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:52:44,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:44,448 INFO L752 eck$LassoCheckResult]: Stem: "[72] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[67] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" [2025-04-26 16:52:44,448 INFO L754 eck$LassoCheckResult]: Loop: "[89] L19-1-->$Ultimate##0: Formula: (= v_i_17 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_17} OutVars{i=v_i_17, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0]" "[82] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[84] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[74] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[85] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[86] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[91] workerEXIT-->L21-2: Formula: (= (+ v_workerThread1of2ForFork0_thidvar0_4 1) v_i_21) InVars {i=v_i_21, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} OutVars{i=v_i_21, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[73] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" [2025-04-26 16:52:44,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:44,448 INFO L85 PathProgramCache]: Analyzing trace with hash 3260, now seen corresponding path program 1 times [2025-04-26 16:52:44,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:44,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403941635] [2025-04-26 16:52:44,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:44,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:44,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:52:44,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:52:44,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:44,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:52:44,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:52:44,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:44,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:44,452 INFO L85 PathProgramCache]: Analyzing trace with hash 920507519, now seen corresponding path program 1 times [2025-04-26 16:52:44,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:44,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270972638] [2025-04-26 16:52:44,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:44,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:44,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:44,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:44,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:44,476 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 16:52:44,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:52:44,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270972638] [2025-04-26 16:52:44,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270972638] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:52:44,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:52:44,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:52:44,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13412173] [2025-04-26 16:52:44,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:52:44,477 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:52:44,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:52:44,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:52:44,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:52:44,478 INFO L87 Difference]: Start difference. First operand has 290 states, 279 states have (on average 1.92831541218638) internal successors, (in total 538), 289 states have internal predecessors, (538), 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.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 16:52:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:52:44,511 INFO L93 Difference]: Finished difference Result 321 states and 648 transitions. [2025-04-26 16:52:44,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 321 states and 648 transitions. [2025-04-26 16:52:44,514 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 148 [2025-04-26 16:52:44,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 321 states to 308 states and 620 transitions. [2025-04-26 16:52:44,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2025-04-26 16:52:44,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2025-04-26 16:52:44,517 INFO L74 IsDeterministic]: Start isDeterministic. Operand 308 states and 620 transitions. [2025-04-26 16:52:44,518 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:52:44,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 308 states and 620 transitions. [2025-04-26 16:52:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 620 transitions. [2025-04-26 16:52:44,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 256. [2025-04-26 16:52:44,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 256 states have (on average 2.015625) internal successors, (in total 516), 255 states have internal predecessors, (516), 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 16:52:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 516 transitions. [2025-04-26 16:52:44,533 INFO L240 hiAutomatonCegarLoop]: Abstraction has 256 states and 516 transitions. [2025-04-26 16:52:44,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:52:44,536 INFO L438 stractBuchiCegarLoop]: Abstraction has 256 states and 516 transitions. [2025-04-26 16:52:44,536 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:52:44,537 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 256 states and 516 transitions. [2025-04-26 16:52:44,538 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 143 [2025-04-26 16:52:44,538 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:44,538 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:44,539 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:52:44,539 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:44,539 INFO L752 eck$LassoCheckResult]: Stem: "[72] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[67] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[89] L19-1-->$Ultimate##0: Formula: (= v_i_17 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_17} OutVars{i=v_i_17, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0]" "[75] L20-->L21-2: Formula: (<= v_i_3 0) InVars {i=v_i_3} OutVars{i=v_i_3} AuxVars[] AssignedVars[]" [2025-04-26 16:52:44,539 INFO L754 eck$LassoCheckResult]: Loop: "[73] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[90] L19-1-->$Ultimate##0: Formula: (= v_i_19 v_workerThread2of2ForFork0_thidvar0_2) InVars {i=v_i_19} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_2, i=v_i_19} AuxVars[] AssignedVars[workerThread2of2ForFork0_thidvar0]" "[74] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[77] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[79] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[80] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[81] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[92] workerEXIT-->L21-2: Formula: (= v_i_23 (+ v_workerThread2of2ForFork0_thidvar0_4 1)) InVars {workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_23} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_23} AuxVars[] AssignedVars[]" [2025-04-26 16:52:44,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash 3135694, now seen corresponding path program 1 times [2025-04-26 16:52:44,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:44,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871192890] [2025-04-26 16:52:44,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:44,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:44,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:44,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:44,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:44,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:44,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:44,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:44,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:44,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1326702337, now seen corresponding path program 1 times [2025-04-26 16:52:44,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:44,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168236330] [2025-04-26 16:52:44,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:44,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:44,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:44,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:44,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:44,560 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 16:52:44,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:52:44,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168236330] [2025-04-26 16:52:44,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168236330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:52:44,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:52:44,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:52:44,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666637501] [2025-04-26 16:52:44,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:52:44,561 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:52:44,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:52:44,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:52:44,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:52:44,561 INFO L87 Difference]: Start difference. First operand 256 states and 516 transitions. cyclomatic complexity: 277 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (in total 8), 3 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 16:52:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:52:44,604 INFO L93 Difference]: Finished difference Result 302 states and 605 transitions. [2025-04-26 16:52:44,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 302 states and 605 transitions. [2025-04-26 16:52:44,606 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 131 [2025-04-26 16:52:44,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 302 states to 297 states and 593 transitions. [2025-04-26 16:52:44,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 297 [2025-04-26 16:52:44,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 297 [2025-04-26 16:52:44,612 INFO L74 IsDeterministic]: Start isDeterministic. Operand 297 states and 593 transitions. [2025-04-26 16:52:44,613 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:52:44,613 INFO L218 hiAutomatonCegarLoop]: Abstraction has 297 states and 593 transitions. [2025-04-26 16:52:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states and 593 transitions. [2025-04-26 16:52:44,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 261. [2025-04-26 16:52:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 261 states have (on average 1.9808429118773947) internal successors, (in total 517), 260 states have internal predecessors, (517), 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 16:52:44,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 517 transitions. [2025-04-26 16:52:44,627 INFO L240 hiAutomatonCegarLoop]: Abstraction has 261 states and 517 transitions. [2025-04-26 16:52:44,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:52:44,629 INFO L438 stractBuchiCegarLoop]: Abstraction has 261 states and 517 transitions. [2025-04-26 16:52:44,629 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:52:44,629 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 517 transitions. [2025-04-26 16:52:44,631 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 131 [2025-04-26 16:52:44,631 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:44,631 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:44,631 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:52:44,631 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:44,632 INFO L752 eck$LassoCheckResult]: Stem: "[72] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[67] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[89] L19-1-->$Ultimate##0: Formula: (= v_i_17 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_17} OutVars{i=v_i_17, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0]" "[75] L20-->L21-2: Formula: (<= v_i_3 0) InVars {i=v_i_3} OutVars{i=v_i_3} AuxVars[] AssignedVars[]" [2025-04-26 16:52:44,632 INFO L754 eck$LassoCheckResult]: Loop: "[82] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[73] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[90] L19-1-->$Ultimate##0: Formula: (= v_i_19 v_workerThread2of2ForFork0_thidvar0_2) InVars {i=v_i_19} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_2, i=v_i_19} AuxVars[] AssignedVars[workerThread2of2ForFork0_thidvar0]" "[74] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[77] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[79] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[80] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[81] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[85] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[86] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[91] workerEXIT-->L21-2: Formula: (= (+ v_workerThread1of2ForFork0_thidvar0_4 1) v_i_21) InVars {i=v_i_21, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} OutVars{i=v_i_21, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[73] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[89] L19-1-->$Ultimate##0: Formula: (= v_i_17 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_17} OutVars{i=v_i_17, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0]" "[74] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[92] workerEXIT-->L21-2: Formula: (= v_i_23 (+ v_workerThread2of2ForFork0_thidvar0_4 1)) InVars {workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_23} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_23} AuxVars[] AssignedVars[]" [2025-04-26 16:52:44,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:44,632 INFO L85 PathProgramCache]: Analyzing trace with hash 3135694, now seen corresponding path program 2 times [2025-04-26 16:52:44,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:44,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219822184] [2025-04-26 16:52:44,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:52:44,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:44,634 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:44,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:44,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:52:44,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,635 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:44,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:44,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:44,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:44,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1285778387, now seen corresponding path program 1 times [2025-04-26 16:52:44,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:44,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631877566] [2025-04-26 16:52:44,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:44,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:44,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:52:44,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:52:44,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:44,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:52:44,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:52:44,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:44,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:44,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:44,671 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: No thread ID for procedure ULTIMATE.start at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createThreadIds(IcfgProgramExecution.java:218) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:115) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.computeIcfgProgramExecution(IcfgProgramExecutionBuilder.java:175) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.getIcfgProgramExecution(IcfgProgramExecutionBuilder.java:74) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:441) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:377) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:353) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:883) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopFeasibility(LassoCheck.java:847) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:767) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runSingleCegarLoop(BuchiAutomizerObserver.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:377) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-04-26 16:52:44,679 INFO L158 Benchmark]: Toolchain (without parser) took 1698.58ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.3MB in the beginning and 26.5MB in the end (delta: 59.8MB). Peak memory consumption was 44.4MB. Max. memory is 8.0GB. [2025-04-26 16:52:44,681 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:44,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.79ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.5MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:52:44,682 INFO L158 Benchmark]: Boogie Preprocessor took 14.04ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.5MB in the end (delta: 880.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:44,682 INFO L158 Benchmark]: RCFGBuilder took 138.60ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 74.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:52:44,682 INFO L158 Benchmark]: BuchiAutomizer took 1505.91ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.7MB in the beginning and 26.5MB in the end (delta: 48.2MB). Peak memory consumption was 31.8MB. Max. memory is 8.0GB. [2025-04-26 16:52:44,683 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 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.79ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.5MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.04ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.5MB in the end (delta: 880.4kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 138.60ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 74.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1505.91ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.7MB in the beginning and 26.5MB in the end (delta: 48.2MB). Peak memory consumption was 31.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 17 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN2 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 161, Number of transitions in reduction automaton: 67, Number of states in reduction automaton: 45, Underlying: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: No thread ID for procedure ULTIMATE.start de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: No thread ID for procedure ULTIMATE.start: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createThreadIds(IcfgProgramExecution.java:218) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-04-26 16:52:44,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...