fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r086-smll-174860102700527
Last Updated
June 24, 2025

About the Execution of ITS-Tools for FlexibleBarrier-PT-18b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 28235.00 0.00 0.00 TTTTTFFTTFFTTFTF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102700527.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is FlexibleBarrier-PT-18b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102700527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.2M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748974233092

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-18b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-03 18:10:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 18:10:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 18:10:36] [INFO ] Load time of PNML (sax parser for PT used): 534 ms
[2025-06-03 18:10:36] [INFO ] Transformed 4370 places.
[2025-06-03 18:10:36] [INFO ] Transformed 5037 transitions.
[2025-06-03 18:10:36] [INFO ] Found NUPN structural information;
[2025-06-03 18:10:36] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 806 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (327 resets) in 3345 ms. (11 steps per ms) remains 11/16 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (23 resets) in 341 ms. (116 steps per ms) remains 10/11 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (27 resets) in 298 ms. (133 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 173 ms. (229 steps per ms) remains 9/10 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (13 resets) in 969 ms. (41 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (23 resets) in 270 ms. (147 steps per ms) remains 8/9 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 646 ms. (61 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (26 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
[2025-06-03 18:10:38] [INFO ] Flatten gal took : 750 ms
BEST_FIRST walk for 40004 steps (25 resets) in 273 ms. (146 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (25 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (22 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
// Phase 1: matrix 5037 rows 4370 cols
[2025-06-03 18:10:39] [INFO ] Flatten gal took : 411 ms
[2025-06-03 18:10:39] [INFO ] Computed 20 invariants in 255 ms
[2025-06-03 18:10:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15791136225303004925.gal : 193 ms
[2025-06-03 18:10:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3846857375575889126.prop : 3 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/ReachabilityCardinality15791136225303004925.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3846857375575889126.prop' '--nowitness' '--gen-order' 'FOLLOW'
Excessive predecessor constraint size, skipping predecessor.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Loading property file /tmp/ReachabilityCardinality3846857375575889126.prop.
At refinement iteration 2 (OVERLAPS) 4259/4370 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4370 variables, 4259/4390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4370 variables, 0/4390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 5725ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 111 out of 4370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Graph (trivial) has 3270 edges and 4370 vertex of which 54 / 4370 are part of one of the 9 SCC in 29 ms
Free SCC test removed 45 places
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 746 transitions
Trivial Post-agglo rules discarded 746 transitions
Performed 746 trivial Post agglomeration. Transition count delta: 746
Iterating post reduction 0 with 746 rules applied. Total rules applied 747 place count 4325 transition count 4237
Reduce places removed 746 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 765 rules applied. Total rules applied 1512 place count 3579 transition count 4218
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 1531 place count 3560 transition count 4218
Performed 574 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 574 Pre rules applied. Total rules applied 1531 place count 3560 transition count 3644
Deduced a syphon composed of 574 places in 7 ms
Reduce places removed 574 places and 0 transitions.
Iterating global reduction 3 with 1148 rules applied. Total rules applied 2679 place count 2986 transition count 3644
Discarding 1712 places :
Symmetric choice reduction at 3 with 1712 rule applications. Total rules 4391 place count 1274 transition count 1932
Iterating global reduction 3 with 1712 rules applied. Total rules applied 6103 place count 1274 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6104 place count 1274 transition count 1931
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 6104 place count 1274 transition count 1922
Deduced a syphon composed of 9 places in 21 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 6122 place count 1265 transition count 1922
Discarding 246 places :
Symmetric choice reduction at 4 with 246 rule applications. Total rules 6368 place count 1019 transition count 1676
Iterating global reduction 4 with 246 rules applied. Total rules applied 6614 place count 1019 transition count 1676
Ensure Unique test removed 228 transitions
Reduce isomorphic transitions removed 228 transitions.
Iterating post reduction 4 with 228 rules applied. Total rules applied 6842 place count 1019 transition count 1448
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 3 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 5 with 242 rules applied. Total rules applied 7084 place count 898 transition count 1327
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 7100 place count 890 transition count 1327
Free-agglomeration rule applied 201 times.
Iterating global reduction 5 with 201 rules applied. Total rules applied 7301 place count 890 transition count 1126
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 5 with 201 rules applied. Total rules applied 7502 place count 689 transition count 1126
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 7505 place count 686 transition count 1123
Iterating global reduction 6 with 3 rules applied. Total rules applied 7508 place count 686 transition count 1123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 7511 place count 686 transition count 1120
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 7525 place count 686 transition count 1106
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 7532 place count 686 transition count 1106
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 7533 place count 686 transition count 1106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 7534 place count 685 transition count 1105
Applied a total of 7534 rules in 1817 ms. Remains 685 /4370 variables (removed 3685) and now considering 1105/5037 (removed 3932) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1836 ms. Remains : 685/4370 places, 1105/5037 transitions.
RANDOM walk for 40000 steps (909 resets) in 1774 ms. (22 steps per ms) remains 7/8 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (37 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 208 ms. (191 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 309 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (37 resets) in 180 ms. (221 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (31 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
[2025-06-03 18:10:47] [INFO ] Flow matrix only has 1080 transitions (discarded 25 similar events)
// Phase 1: matrix 1080 rows 685 cols
[2025-06-03 18:10:47] [INFO ] Computed 20 invariants in 25 ms
[2025-06-03 18:10:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 575/685 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/685 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1765 variables, 685/705 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1765 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1765 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/1765 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1765/1765 variables, and 706 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1574 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 685/685 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 575/685 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:50] [INFO ] Deduced a trap composed of 74 places in 781 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:50] [INFO ] Deduced a trap composed of 311 places in 682 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:51] [INFO ] Deduced a trap composed of 311 places in 711 ms of which 110 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/685 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/685 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1080/1765 variables, 685/708 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1765 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1765 variables, 3/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1765 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/1765 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1765/1765 variables, and 712 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5232 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 685/685 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6892ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 1125 ms.
Support contains 47 out of 685 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 685/685 places, 1105/1105 transitions.
Graph (trivial) has 130 edges and 685 vertex of which 6 / 685 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 682 transition count 1089
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 672 transition count 1088
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 671 transition count 1088
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 42 place count 652 transition count 1069
Iterating global reduction 3 with 19 rules applied. Total rules applied 61 place count 652 transition count 1069
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 652 transition count 1066
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 64 place count 652 transition count 1065
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 651 transition count 1065
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 110 place count 629 transition count 1043
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 116 place count 629 transition count 1037
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 130 place count 615 transition count 1023
Iterating global reduction 5 with 14 rules applied. Total rules applied 144 place count 615 transition count 1023
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 158 place count 615 transition count 1009
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 162 place count 615 transition count 1005
Free-agglomeration rule applied 67 times with reduction of 1 identical transitions.
Iterating global reduction 6 with 67 rules applied. Total rules applied 229 place count 615 transition count 937
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 71 rules applied. Total rules applied 300 place count 548 transition count 933
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 327 place count 521 transition count 906
Iterating global reduction 7 with 27 rules applied. Total rules applied 354 place count 521 transition count 906
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 381 place count 521 transition count 879
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 384 place count 521 transition count 876
Applied a total of 384 rules in 299 ms. Remains 521 /685 variables (removed 164) and now considering 876/1105 (removed 229) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 521/685 places, 876/1105 transitions.
RANDOM walk for 40000 steps (374 resets) in 376 ms. (106 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 288 ms. (138 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (36 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 62
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :62 after 1954
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :1954 after 85245
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :85245 after 1.65003e+08
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1.65003e+08 after 6.18449e+14
Interrupted probabilistic random walk after 310708 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 310708 steps, saw 77338 distinct states, run finished after 3011 ms. (steps per millisecond=103 ) properties seen :0
[2025-06-03 18:10:58] [INFO ] Flow matrix only has 848 transitions (discarded 28 similar events)
// Phase 1: matrix 848 rows 521 cols
[2025-06-03 18:10:58] [INFO ] Computed 20 invariants in 17 ms
[2025-06-03 18:10:58] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 450/497 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :6.18449e+14 after 1.97457e+26
At refinement iteration 3 (OVERLAPS) 848/1345 variables, 497/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1345 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1345 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/1369 variables, 24/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1369 variables, 4/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1369 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1369 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1369/1369 variables, and 542 constraints, problems are : Problem set: 0 solved, 2 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 521/521 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 450/497 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 848/1345 variables, 497/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1345 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1345 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/1369 variables, 24/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1369 variables, 4/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1369 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1369 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 542 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1387 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 521/521 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2313ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-08 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 110 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=110 )
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2025-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 31 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 25750 ms.

BK_STOP 1748974261327

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-18b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-18b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102700527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-18b.tgz
mv FlexibleBarrier-PT-18b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;