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.r034-tall-177946842100639.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 itstools
Input is CANConstruction-PT-030, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100639
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 9.2K Mar 6 09:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 6 09:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 6 09:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 09:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 15 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 15 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 09:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 6 09:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 09:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 6 09:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:50 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 1.4M 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779636883904

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 15:34:45] [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]
[2026-05-24 15:34:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 15:34:45] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2026-05-24 15:34:45] [INFO ] Transformed 2162 places.
[2026-05-24 15:34:45] [INFO ] Transformed 3840 transitions.
[2026-05-24 15:34:45] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (75 resets) in 2479 ms. (16 steps per ms) remains 5/16 properties
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 5/5 properties
[2026-05-24 15:34:46] [INFO ] Flatten gal took : 513 ms
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 5/5 properties
[2026-05-24 15:34:46] [INFO ] Flatten gal took : 166 ms
[2026-05-24 15:34:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1417716858295752704.gal : 82 ms
BEST_FIRST walk for 40004 steps (8 resets) in 933 ms. (42 steps per ms) remains 5/5 properties
[2026-05-24 15:34:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7309076109956028442.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1417716858295752704.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7309076109956028442.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18154620642617301204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13410309657881075318.kers'
[2026-05-24 15:34:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18154620642617301204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13410309657881075318.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3840 rows 2162 cols 7860 entries
Finished phase 1 with 2071 SingleSign rule and 30 generalized
[2026-05-24 15:34:46] [INFO ] Computed 61 invariants in 13 ms
Computed 61 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-13410309657881075318.kers
Total runtime 20 ms.
[2026-05-24 15:34:46] [INFO ] State equation strengthened by 1770 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality7309076109956028442.prop.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1969/2092 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2092 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/2095 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2095 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 67/2162 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2162 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3840/6002 variables, 2162/2223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6002 variables, 1770/3993 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6002 variables, 0/3993 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :32 after 33
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :33 after 35
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :35 after 38
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :38 after 44
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :44 after 55
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :55 after 64
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :64 after 74
At refinement iteration 10 (OVERLAPS) 0/6002 variables, 0/3993 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :74 after 85
After SMT solving in domain Real declared 6002/6002 variables, and 3993 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3918 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 2162/2162 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1969/2092 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :991 after 1018
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1018 after 1076
SMT process timed out in 9242ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 123 out of 2162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 2162 transition count 3720
Reduce places removed 120 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 156 rules applied. Total rules applied 276 place count 2042 transition count 3684
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 312 place count 2006 transition count 3684
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 312 place count 2006 transition count 3665
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 350 place count 1987 transition count 3665
Discarding 796 places :
Symmetric choice reduction at 3 with 796 rule applications. Total rules 1146 place count 1191 transition count 2073
Iterating global reduction 3 with 796 rules applied. Total rules applied 1942 place count 1191 transition count 2073
SDD proceeding with computation,5 properties remain. new max is 8192
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1958 place count 1183 transition count 2065
SDD size :1076 after 1241
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1968 place count 1183 transition count 2055
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1978 place count 1173 transition count 2055
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1979 place count 1173 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1980 place count 1172 transition count 2054
Partial Free-agglomeration rule applied 63 times.
Drop transitions (Partial Free agglomeration) removed 63 transitions
Iterating global reduction 5 with 63 rules applied. Total rules applied 2043 place count 1172 transition count 2054
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 2057 place count 1172 transition count 2054
Applied a total of 2057 rules in 1011 ms. Remains 1172 /2162 variables (removed 990) and now considering 2054/3840 (removed 1786) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1020 ms. Remains : 1172/2162 places, 2054/3840 transitions.
RANDOM walk for 40000 steps (160 resets) in 759 ms. (52 steps per ms) remains 1/5 properties
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14736808820071452405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5950957466183916299.kers'
[2026-05-24 15:34:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14736808820071452405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5950957466183916299.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 2054 rows 1172 cols 4319 entries
Finished phase 1 with 1081 SingleSign rule and 30 generalized
[2026-05-24 15:34:57] [INFO ] Computed 61 invariants in 6 ms
Computed 61 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5950957466183916299.kers
Total runtime 8 ms.
[2026-05-24 15:34:57] [INFO ] State equation strengthened by 1809 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/79 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 67/146 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1241 after 3177
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 16/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1025/1171 variables, 54/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1171 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2054/3225 variables, 1171/1408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3225 variables, 1809/3217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3225 variables, 0/3217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/3226 variables, 1/3218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3226 variables, 0/3218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/3226 variables, 0/3218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3226/3226 variables, and 3218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11664 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1172/1172 constraints, ReadFeed: 1809/1809 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 176/176 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/79 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 67/146 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 176/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1025/1171 variables, 54/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :3177 after 4283
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :4283 after 6567
SMT process timed out in 56777ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1172/1172 places, 2054/2054 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1172 transition count 2023
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1141 transition count 2023
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 79 place count 1124 transition count 1989
Iterating global reduction 2 with 17 rules applied. Total rules applied 96 place count 1124 transition count 1989
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 176 place count 1084 transition count 1949
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 196 place count 1074 transition count 1956
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 200 place count 1074 transition count 1956
Applied a total of 200 rules in 396 ms. Remains 1074 /1172 variables (removed 98) and now considering 1956/2054 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 1074/1172 places, 1956/2054 transitions.
RANDOM walk for 40000 steps (197 resets) in 574 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 222770 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 1
Probabilistic random walk after 222770 steps, saw 59349 distinct states, run finished after 3009 ms. (steps per millisecond=74 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6482659796383267865.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15849239306619293965.kers'
[2026-05-24 15:35:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6482659796383267865.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15849239306619293965.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1956 rows 1074 cols 4112 entries
Finished phase 1 with 983 SingleSign rule and 30 generalized
[2026-05-24 15:35:57] [INFO ] Computed 61 invariants in 6 ms
Computed 61 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-15849239306619293965.kers
Total runtime 9 ms.
[2026-05-24 15:35:57] [INFO ] State equation strengthened by 1867 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/74 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/138 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 935/1073 variables, 54/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1073 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1956/3029 variables, 1073/1147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3029 variables, 1867/3014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3029 variables, 0/3014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/3030 variables, 1/3015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3030 variables, 0/3015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3030 variables, 0/3015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3030/3030 variables, and 3015 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1857 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1074/1074 constraints, ReadFeed: 1867/1867 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/74 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/138 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 935/1073 variables, 54/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :6567 after 8553
At refinement iteration 11 (INCLUDED_ONLY) 0/1073 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1073 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1073 variables, 14/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1073 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1956/3029 variables, 1073/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3029 variables, 1867/3101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3029 variables, 1/3102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3029 variables, 0/3102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/3030 variables, 1/3103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3030 variables, 0/3103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/3030 variables, 0/3103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3030/3030 variables, and 3103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 48600 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1074/1074 constraints, ReadFeed: 1867/1867 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50497ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 593 steps, including 63 resets, run visited all 1 properties in 6 ms. (steps per millisecond=98 )
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 13 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 123372 ms.

BK_STOP 1779637008477

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="CANConstruction-PT-030"
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-5973"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-030, 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 r034-tall-177946842100639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-030.tgz
mv CANConstruction-PT-030 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 ;