fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r143-smll-177955812400042
Last Updated
Jun 17, 2026

About the Execution of 2025-gold for FlexibleBarrier-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
375.523 32417.00 48952.00 285.20 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r143-smll-177955812400042.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is FlexibleBarrier-PT-06b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-smll-177955812400042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.7K Mar 7 05:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 05:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 05:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 05:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 05:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 7 05:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 05:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 141K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779626608755

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-24 12:43:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 12:43:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:43:31] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2026-05-24 12:43:31] [INFO ] Transformed 542 places.
[2026-05-24 12:43:31] [INFO ] Transformed 621 transitions.
[2026-05-24 12:43:31] [INFO ] Found NUPN structural information;
[2026-05-24 12:43:31] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 462 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 621 rows 542 cols
[2026-05-24 12:43:32] [INFO ] Computed 8 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (191 resets) in 94 ms. (105 steps per ms)
FORMULA FlexibleBarrier-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (112 resets) in 84 ms. (470 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-24 12:43:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:43:33] [INFO ] [Real]Absence check using 8 positive place invariants in 34 ms returned sat
[2026-05-24 12:43:33] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:43:34] [INFO ] Deduced a trap composed of 64 places in 598 ms of which 107 ms to minimize.
[2026-05-24 12:43:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:43:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 28 ms returned sat
[2026-05-24 12:43:35] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2026-05-24 12:43:35] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 84 ms.
[2026-05-24 12:43:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:43:39] [INFO ] [Real]Absence check using 8 positive place invariants in 33 ms returned sat
[2026-05-24 12:43:40] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:43:40] [INFO ] Deduced a trap composed of 109 places in 604 ms of which 145 ms to minimize.
[2026-05-24 12:43:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:43:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 35 ms returned sat
[2026-05-24 12:43:41] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:43:42] [INFO ] Deduced a trap composed of 64 places in 573 ms of which 70 ms to minimize.
[2026-05-24 12:43:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 659 ms
[2026-05-24 12:43:42] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 79 ms.
[2026-05-24 12:43:45] [INFO ] Added : 265 causal constraints over 53 iterations in 3638 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:43:46] [INFO ] [Real]Absence check using 8 positive place invariants in 28 ms returned sat
[2026-05-24 12:43:46] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:43:47] [INFO ] Deduced a trap composed of 46 places in 599 ms of which 94 ms to minimize.
[2026-05-24 12:43:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:43:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 29 ms returned sat
[2026-05-24 12:43:47] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:43:48] [INFO ] Deduced a trap composed of 46 places in 561 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:43:49] [INFO ] Deduced a trap composed of 18 places in 545 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:43:49] [INFO ] Deduced a trap composed of 155 places in 541 ms of which 139 ms to minimize.
[2026-05-24 12:43:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1812 ms
[2026-05-24 12:43:49] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 62 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:43:52] [INFO ] [Real]Absence check using 8 positive place invariants in 26 ms returned sat
[2026-05-24 12:43:53] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:43:53] [INFO ] Deduced a trap composed of 129 places in 628 ms of which 174 ms to minimize.
[2026-05-24 12:43:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:43:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 29 ms returned sat
[2026-05-24 12:43:54] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:43:55] [INFO ] Deduced a trap composed of 46 places in 520 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:43:55] [INFO ] Deduced a trap composed of 129 places in 591 ms of which 175 ms to minimize.
[2026-05-24 12:43:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1227 ms
[2026-05-24 12:43:55] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 72 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 1] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 621/621 transitions.
Graph (trivial) has 516 edges and 542 vertex of which 38 / 542 are part of one of the 6 SCC in 8 ms
Free SCC test removed 32 places
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 510 transition count 437
Reduce places removed 145 places and 0 transitions.
Iterating post reduction 1 with 145 rules applied. Total rules applied 291 place count 365 transition count 437
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 291 place count 365 transition count 408
Deduced a syphon composed of 29 places in 4 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 349 place count 336 transition count 408
Discarding 166 places :
Symmetric choice reduction at 2 with 166 rule applications. Total rules 515 place count 170 transition count 242
Iterating global reduction 2 with 166 rules applied. Total rules applied 681 place count 170 transition count 242
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 681 place count 170 transition count 236
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 693 place count 164 transition count 236
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 697 place count 164 transition count 232
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 721 place count 140 transition count 208
Iterating global reduction 3 with 24 rules applied. Total rules applied 745 place count 140 transition count 208
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 768 place count 140 transition count 185
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 830 place count 109 transition count 154
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 838 place count 109 transition count 146
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 844 place count 103 transition count 140
Iterating global reduction 5 with 6 rules applied. Total rules applied 850 place count 103 transition count 140
Free-agglomeration rule applied 64 times.
Iterating global reduction 5 with 64 rules applied. Total rules applied 914 place count 103 transition count 76
Reduce places removed 64 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 97 edges and 39 vertex of which 34 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 90 rules applied. Total rules applied 1004 place count 34 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1011 place count 34 transition count 44
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1012 place count 34 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1013 place count 33 transition count 43
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 34 edges and 31 vertex of which 21 / 31 are part of one of the 6 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 5 rules applied. Total rules applied 1018 place count 16 transition count 41
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 31 rules applied. Total rules applied 1049 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 1052 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1053 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1053 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1055 place count 10 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1056 place count 10 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1057 place count 9 transition count 9
Applied a total of 1057 rules in 266 ms. Remains 9 /542 variables (removed 533) and now considering 9/621 (removed 612) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 9/542 places, 9/621 transitions.
// Phase 1: matrix 9 rows 9 cols
[2026-05-24 12:43:59] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0, 1] Max Struct:[1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 833 ms. (1199 steps per ms)
FORMULA FlexibleBarrier-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 241 ms. (4132 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-24 12:44:01] [INFO ] Flatten gal took : 21 ms
[2026-05-24 12:44:01] [INFO ] Flatten gal took : 2 ms
[2026-05-24 12:44:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2516178948129937991.gal : 6 ms
[2026-05-24 12:44:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16576442420909340966.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2516178948129937991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16576442420909340966.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 29741 ms.

BK_STOP 1779626641172

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-06b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool gold2025"
echo " Input is FlexibleBarrier-PT-06b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r143-smll-177955812400042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-06b.tgz
mv FlexibleBarrier-PT-06b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;