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-177946842100630.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-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100630
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 11K Mar 6 09:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 6 09:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 6 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 6 09:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 15 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 09:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 6 09:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 6 09:35 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 641K 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-020-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779633227816

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 14:33:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 14:33:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 14:33:49] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2026-05-24 14:33:49] [INFO ] Transformed 1042 places.
[2026-05-24 14:33:49] [INFO ] Transformed 1760 transitions.
[2026-05-24 14:33:49] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (113 resets) in 1800 ms. (22 steps per ms) remains 6/16 properties
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
[2026-05-24 14:33:49] [INFO ] Flatten gal took : 234 ms
[2026-05-24 14:33:50] [INFO ] Flatten gal took : 109 ms
BEST_FIRST walk for 40004 steps (8 resets) in 638 ms. (62 steps per ms) remains 6/6 properties
[2026-05-24 14:33:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14412603212123204350.gal : 95 ms
[2026-05-24 14:33:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality692659958746696477.prop : 7 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/ReachabilityCardinality14412603212123204350.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality692659958746696477.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 6/6 properties

its-reach command run as :

BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
/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
Loading property file /tmp/ReachabilityCardinality692659958746696477.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 441 ms. (90 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11074663401791073862.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16006538373483421258.kers'
[2026-05-24 14:33:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11074663401791073862.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16006538373483421258.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1760 rows 1042 cols 3640 entries
Finished phase 1 with 981 SingleSign rule and 20 generalized
[2026-05-24 14:33:50] [INFO ] Computed 41 invariants in 6 ms
Computed 41 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16006538373483421258.kers
Total runtime 9 ms.
[2026-05-24 14:33:50] [INFO ] State equation strengthened by 780 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :11 after 13
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :13 after 15
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :15 after 17
Problem CANConstruction-PT-020-ReachabilityCardinality-2024-00 is UNSAT
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-020-ReachabilityCardinality-2024-02 is UNSAT
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :17 after 24
At refinement iteration 1 (OVERLAPS) 861/996 variables, 34/34 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :24 after 116
At refinement iteration 2 (INCLUDED_ONLY) 0/996 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/1000 variables, 4/38 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :116 after 119
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :119 after 138
Problem CANConstruction-PT-020-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 41/1041 variables, 3/41 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :138 after 164
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :164 after 271
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :271 after 403
At refinement iteration 7 (OVERLAPS) 1760/2801 variables, 1041/1082 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 780/1862 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2801 variables, 0/1862 constraints. Problems are: Problem set: 3 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :403 after 582
At refinement iteration 10 (OVERLAPS) 1/2802 variables, 1/1863 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2802 variables, 0/1863 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/2802 variables, 0/1863 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2802/2802 variables, and 1863 constraints, problems are : Problem set: 3 solved, 3 unsolved in 2453 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1042/1042 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 828/940 variables, 31/31 constraints. Problems are: Problem set: 3 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :582 after 14703
SMT process timed out in 7734ms, After SMT, problems are : Problem set: 3 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 112 out of 1042 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1042 transition count 1659
Reduce places removed 101 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 114 rules applied. Total rules applied 215 place count 941 transition count 1646
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 228 place count 928 transition count 1646
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 228 place count 928 transition count 1642
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 236 place count 924 transition count 1642
Discarding 323 places :
Symmetric choice reduction at 3 with 323 rule applications. Total rules 559 place count 601 transition count 996
Iterating global reduction 3 with 323 rules applied. Total rules applied 882 place count 601 transition count 996
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 15 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 904 place count 590 transition count 985
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 910 place count 587 transition count 1023
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 920 place count 587 transition count 1013
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 930 place count 577 transition count 1013
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 935 place count 577 transition count 1008
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 940 place count 572 transition count 1008
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 966 place count 572 transition count 1008
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 969 place count 572 transition count 1008
Applied a total of 969 rules in 723 ms. Remains 572 /1042 variables (removed 470) and now considering 1008/1760 (removed 752) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 756 ms. Remains : 572/1042 places, 1008/1760 transitions.
RANDOM walk for 40000 steps (237 resets) in 688 ms. (58 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 279 ms. (142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 221 ms. (180 steps per ms) remains 2/3 properties
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7054502368637002176.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10302900354665326754.kers'
[2026-05-24 14:33:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7054502368637002176.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10302900354665326754.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1008 rows 572 cols 2154 entries
Finished phase 1 with 511 SingleSign rule and 20 generalized
[2026-05-24 14:33:59] [INFO ] Computed 41 invariants in 3 ms
Computed 41 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-10302900354665326754.kers
Total runtime 12 ms.
[2026-05-24 14:33:59] [INFO ] State equation strengthened by 840 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 444/510 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/519 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/548 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 23/571 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :14703 after 17188
At refinement iteration 9 (OVERLAPS) 1008/1579 variables, 571/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1579 variables, 840/1452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1579 variables, 0/1452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1580 variables, 1/1453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1580 variables, 0/1453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1580 variables, 0/1453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1580/1580 variables, and 1453 constraints, problems are : Problem set: 0 solved, 2 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 572/572 constraints, ReadFeed: 840/840 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 444/510 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :17188 after 22966
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :22966 after 30185
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem CANConstruction-PT-020-ReachabilityCardinality-2024-04 is UNSAT
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 3/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/519 variables, 9/160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/519 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 29/548 variables, 3/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/548 variables, 2/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 4/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 23/571 variables, 2/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1008/1579 variables, 571/742 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1579 variables, 840/1582 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1579 variables, 1/1583 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1579 variables, 0/1583 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1580 variables, 1/1584 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1580 variables, 0/1584 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1580 variables, 0/1584 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1580/1580 variables, and 1584 constraints, problems are : Problem set: 1 solved, 1 unsolved in 19499 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 572/572 constraints, ReadFeed: 840/840 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 130/130 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20521ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 28 out of 572 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 1008/1008 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 10 place count 572 transition count 998
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 21 place count 562 transition count 997
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 561 transition count 997
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 37 place count 546 transition count 967
Iterating global reduction 3 with 15 rules applied. Total rules applied 52 place count 546 transition count 967
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 84 place count 530 transition count 951
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 100 place count 522 transition count 956
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 522 transition count 954
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 104 place count 520 transition count 954
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 518 transition count 950
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 518 transition count 950
Applied a total of 108 rules in 134 ms. Remains 518 /572 variables (removed 54) and now considering 950/1008 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 518/572 places, 950/1008 transitions.
RANDOM walk for 40000 steps (279 resets) in 531 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 498191 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 1
Probabilistic random walk after 498191 steps, saw 80205 distinct states, run finished after 3006 ms. (steps per millisecond=165 ) 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-13260605473112749207.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8033337353524253967.kers'
[2026-05-24 14:34:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13260605473112749207.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8033337353524253967.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 950 rows 518 cols 2025 entries
Finished phase 1 with 457 SingleSign rule and 20 generalized
[2026-05-24 14:34:23] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8033337353524253967.kers
Total runtime 4 ms.
[2026-05-24 14:34:23] [INFO ] State equation strengthened by 876 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 326/354 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/364 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/395 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 122/517 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 950/1467 variables, 517/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1467 variables, 876/1434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1467 variables, 0/1434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1468 variables, 1/1435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1468 variables, 0/1435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1468 variables, 0/1435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1468/1468 variables, and 1435 constraints, problems are : Problem set: 0 solved, 1 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 518/518 constraints, ReadFeed: 876/876 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 326/354 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/364 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 31/395 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 122/517 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/517 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 950/1467 variables, 517/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1467 variables, 876/1464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1467 variables, 1/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1467 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1468 variables, 1/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1468 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1468 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1468/1468 variables, and 1466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3917 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 518/518 constraints, ReadFeed: 876/876 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4690ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 28 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 950/950 transitions.
Applied a total of 0 rules in 35 ms. Remains 518 /518 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 518/518 places, 950/950 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 950/950 transitions.
Applied a total of 0 rules in 17 ms. Remains 518 /518 variables (removed 0) and now considering 950/950 (removed 0) transitions.
[2026-05-24 14:34:28] [INFO ] Invariant cache hit.
[2026-05-24 14:34:28] [INFO ] Implicit Places using invariants in 317 ms returned [5, 11, 17, 23, 29, 37, 44, 50, 56, 61, 65, 69, 75, 81, 85, 91, 95, 99, 104, 110]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 326 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 498/518 places, 950/950 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 497 transition count 949
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 497 transition count 949
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 50 place count 473 transition count 925
Applied a total of 50 rules in 172 ms. Remains 473 /498 variables (removed 25) and now considering 925/950 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16685665677405073681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12122409881816442533.kers'
[2026-05-24 14:34:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16685665677405073681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12122409881816442533.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 925 rows 473 cols 1984 entries
Finished phase 1 with 452 SingleSign rule and 0 generalized
[2026-05-24 14:34:28] [INFO ] Computed 21 invariants in 8 ms
Computed 21 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12122409881816442533.kers
Total runtime 9 ms.
[2026-05-24 14:34:28] [INFO ] Implicit Places using invariants in 284 ms returned []
[2026-05-24 14:34:28] [INFO ] Invariant cache hit.
[2026-05-24 14:34:29] [INFO ] State equation strengthened by 850 read => feed constraints.
[2026-05-24 14:34:31] [INFO ] Implicit Places using invariants and state equation in 2728 ms returned []
Implicit Place search using SMT with State Equation took 3017 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 473/518 places, 925/950 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3532 ms. Remains : 473/518 places, 925/950 transitions.
RANDOM walk for 40000 steps (299 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 512194 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 512194 steps, saw 119967 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2026-05-24 14:34:34] [INFO ] Invariant cache hit.
[2026-05-24 14:34:34] [INFO ] State equation strengthened by 850 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 439/467 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/472 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 925/1397 variables, 472/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1397 variables, 850/1343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1397 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1398 variables, 1/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1398 variables, 0/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1398 variables, 0/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1398/1398 variables, and 1344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 473/473 constraints, ReadFeed: 850/850 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 439/467 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/472 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 925/1397 variables, 472/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1397 variables, 850/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1397 variables, 1/1375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1397 variables, 0/1375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1398 variables, 1/1376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1398 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1398 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1398/1398 variables, and 1376 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5865 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 473/473 constraints, ReadFeed: 850/850 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6280ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 28 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 925/925 transitions.
Applied a total of 0 rules in 92 ms. Remains 473 /473 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 473/473 places, 925/925 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 925/925 transitions.
Applied a total of 0 rules in 79 ms. Remains 473 /473 variables (removed 0) and now considering 925/925 (removed 0) transitions.
[2026-05-24 14:34:41] [INFO ] Invariant cache hit.
[2026-05-24 14:34:41] [INFO ] Implicit Places using invariants in 266 ms returned []
[2026-05-24 14:34:41] [INFO ] Invariant cache hit.
[2026-05-24 14:34:41] [INFO ] State equation strengthened by 850 read => feed constraints.
[2026-05-24 14:34:44] [INFO ] Implicit Places using invariants and state equation in 2503 ms returned []
Implicit Place search using SMT with State Equation took 2772 ms to find 0 implicit places.
[2026-05-24 14:34:44] [INFO ] Redundant transitions in 71 ms returned []
Running 905 sub problems to find dead transitions.
[2026-05-24 14:34:44] [INFO ] Invariant cache hit.
[2026-05-24 14:34:44] [INFO ] State equation strengthened by 850 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 905 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 905 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 905 unsolved
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :30185 after 588119
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 905 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 905 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 905 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 905 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1398 variables, and 141 constraints, problems are : Problem set: 0 solved, 905 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/473 constraints, ReadFeed: 0/850 constraints, PredecessorRefiner: 905/905 constraints, Known Traps: 120/120 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 905 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 905 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 120/141 constraints. Problems are: Problem set: 0 solved, 905 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 905 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 905 unsolved
SMT process timed out in 62317ms, After SMT, problems are : Problem set: 0 solved, 905 unsolved
Search for dead transitions found 0 dead transitions in 62323ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65331 ms. Remains : 473/473 places, 925/925 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 758 edges and 473 vertex of which 338 / 473 are part of one of the 17 SCC in 2 ms
Free SCC test removed 321 places
Drop transitions (Empty/Sink Transition effects.) removed 628 transitions
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 692 transitions.
Graph (complete) has 304 edges and 152 vertex of which 121 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 87 rules applied. Total rules applied 89 place count 121 transition count 136
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 190 place count 68 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 192 place count 66 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 66 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 196 place count 66 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 65 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 200 place count 64 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 202 place count 64 transition count 82
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 205 place count 64 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 208 place count 61 transition count 79
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 216 place count 61 transition count 79
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 223 place count 54 transition count 72
Iterating global reduction 4 with 7 rules applied. Total rules applied 230 place count 54 transition count 72
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 235 place count 49 transition count 67
Applied a total of 235 rules in 53 ms. Remains 49 /473 variables (removed 424) and now considering 67/925 (removed 858) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10915513203009670207.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16031060219102077653.kers'
[2026-05-24 14:35:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10915513203009670207.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16031060219102077653.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 67 rows 44 cols 116 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-24 14:35:46] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16031060219102077653.kers
Total runtime 5 ms.
[2026-05-24 14:35:46] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 14:35:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-24 14:35:46] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 14:35:46] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 14:35:46] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 14:35:46] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:35:46] [INFO ] Flatten gal took : 16 ms
[2026-05-24 14:35:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6539565856653198524.gal : 1 ms
[2026-05-24 14:35:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12014882529825283026.prop : 0 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/ReachabilityCardinality6539565856653198524.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12014882529825283026.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 ...329
Loading property file /tmp/ReachabilityCardinality12014882529825283026.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 320
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :320 after 36480
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.07827e+08,0.010052,4396,2,130,9,723,7,0,282,404,0
Total reachable state count : 107827200

Verifying 1 reachability properties.
Reachability property CANConstruction-PT-020-ReachabilityCardinality-2024-01 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-020-ReachabilityCardinality-2024-01,184320,0.012289,4608,2,75,9,1003,7,0,344,412,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 452 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 14:35:47] [INFO ] Flatten gal took : 157 ms
[2026-05-24 14:35:47] [INFO ] Applying decomposition
[2026-05-24 14:35:47] [INFO ] Flatten gal took : 135 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8789138049738543696.txt' '-o' '/tmp/graph8789138049738543696.bin' '-w' '/tmp/graph8789138049738543696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8789138049738543696.bin' '-l' '-1' '-v' '-w' '/tmp/graph8789138049738543696.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:35:47] [INFO ] Decomposing Gal with order
[2026-05-24 14:35:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:35:48] [INFO ] Removed a total of 934 redundant transitions.
[2026-05-24 14:35:48] [INFO ] Flatten gal took : 416 ms
[2026-05-24 14:35:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 201 labels/synchronizations in 114 ms.
[2026-05-24 14:35:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12183183559671636348.gal : 43 ms
[2026-05-24 14:35:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8421006944755882746.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/ReachabilityCardinality12183183559671636348.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8421006944755882746.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 ...329
Loading property file /tmp/ReachabilityCardinality8421006944755882746.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :25 after 29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29 after 35
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35 after 48
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :48 after 58
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :58 after 103
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :103 after 941
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :941 after 11338
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :11338 after 100361
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :100361 after 106832
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106832 after 657297
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :657297 after 1.01216e+07
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.01216e+07 after 8.98179e+07
Detected timeout of ITS tools.
[2026-05-24 15:05:49] [INFO ] Flatten gal took : 54 ms
Using solver Z3 to compute partial order matrices.
[2026-05-24 15:05:49] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin11518579017573051615
[2026-05-24 15:05:49] [INFO ] Computing symmetric may disable matrix : 925 transitions.
[2026-05-24 15:05:49] [INFO ] Flatten gal took : 57 ms
[2026-05-24 15:05:49] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 15:05:49] [INFO ] Computing symmetric may enable matrix : 925 transitions.
[2026-05-24 15:05:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7097655647512669985.txt' '-o' '/tmp/graph7097655647512669985.bin' '-w' '/tmp/graph7097655647512669985.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7097655647512669985.bin' '-l' '-1' '-v' '-w' '/tmp/graph7097655647512669985.weights' '-q' '0' '-e' '0.001'
[2026-05-24 15:05:49] [INFO ] Decomposing Gal with order
[2026-05-24 15:05:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 15:05:49] [INFO ] Removed a total of 338 redundant transitions.
[2026-05-24 15:05:49] [INFO ] Flatten gal took : 130 ms
[2026-05-24 15:05:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 356 labels/synchronizations in 35 ms.
[2026-05-24 15:05:49] [INFO ] Computing Do-Not-Accords matrix : 925 transitions.
[2026-05-24 15:05:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3410562287872563743.gal : 22 ms
[2026-05-24 15:05:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11061138011426122226.prop : 0 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/ReachabilityCardinality3410562287872563743.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11061138011426122226.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2026-05-24 15:05:49] [INFO ] Computation of Completed DNA matrix. took 64 ms. Total solver calls (SAT/UNSAT): 0(0/0)

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 ...329
[2026-05-24 15:05:49] [INFO ] Built C files in 546ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11518579017573051615
Running compilation step : cd /tmp/ltsmin11518579017573051615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Loading property file /tmp/ReachabilityCardinality11061138011426122226.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 75
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :75 after 79
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :79 after 83
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :83 after 92
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :92 after 116
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :116 after 183
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :183 after 1720
Compilation finished in 2996 ms.
Running link step : cd /tmp/ltsmin11518579017573051615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin11518579017573051615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT020ReachabilityCardinality202401==true'
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1720 after 14181
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :14181 after 16470
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :16470 after 78588
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :78588 after 287954
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :287954 after 804955
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :804955 after 1.96931e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.96931e+06 after 5.83794e+06
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :5.83794e+06 after 3.13603e+07

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-020"
export BK_EXAMINATION="ReachabilityCardinality"
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-020, examination is ReachabilityCardinality"
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-177946842100630"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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