Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683760500166.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is ShieldIIPs-PT-100A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760500166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 11 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 15:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 15:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 868K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716920447142

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 18:20: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]
[2024-05-28 18:20:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:20:48] [INFO ] Load time of PNML (sax parser for PT used): 230 ms
[2024-05-28 18:20:48] [INFO ] Transformed 2503 places.
[2024-05-28 18:20:48] [INFO ] Transformed 2403 transitions.
[2024-05-28 18:20:48] [INFO ] Found NUPN structural information;
[2024-05-28 18:20:48] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 389 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2998 ms. (13 steps per ms) remains 5/14 properties
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1107 ms. (36 steps per ms) remains 5/5 properties
[2024-05-28 18:20:50] [INFO ] Flatten gal took : 799 ms
BEST_FIRST walk for 40003 steps (8 resets) in 1096 ms. (36 steps per ms) remains 5/5 properties
[2024-05-28 18:20:50] [INFO ] Flatten gal took : 459 ms
BEST_FIRST walk for 40004 steps (8 resets) in 1010 ms. (39 steps per ms) remains 5/5 properties
[2024-05-28 18:20:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12679132564399374764.gal : 98 ms
[2024-05-28 18:20:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality468090341150711869.prop : 2 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12679132564399374764.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality468090341150711869.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (8 resets) in 1278 ms. (31 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality468090341150711869.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 929 ms. (43 steps per ms) remains 5/5 properties
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-28 18:20:51] [INFO ] Computed 901 invariants in 56 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 190/275 variables, 90/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 190/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2228/2503 variables, 811/1176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 2228/3404 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/3404 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2403/4906 variables, 2503/5907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4906 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/4906 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4906/4906 variables, and 5907 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3070 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 190/275 variables, 90/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 190/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2228/2503 variables, 811/1176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 2228/3404 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:20:55] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 11 ms to minimize.
[2024-05-28 18:20:55] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-28 18:20:55] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:20:55] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-28 18:20:55] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 5/3409 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2503 variables, 0/3409 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2403/4906 variables, 2503/5912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4906 variables, 5/5917 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:20:59] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-28 18:20:59] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
SMT process timed out in 8288ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 50 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :2 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :5 after 16
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :16 after 33
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :33 after 66
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :66 after 131
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :131 after 260
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :260 after 906
Partial Free-agglomeration rule applied 656 times.
Drop transitions (Partial Free agglomeration) removed 656 transitions
Iterating global reduction 0 with 656 rules applied. Total rules applied 660 place count 2501 transition count 2401
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :906 after 36549
Applied a total of 660 rules in 709 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 2501/2503 places, 2401/2403 transitions.
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :36549 after 57334
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :57334 after 948345
RANDOM walk for 40000 steps (8 resets) in 2236 ms. (17 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :948345 after 1.61321e+08
BEST_FIRST walk for 40004 steps (8 resets) in 714 ms. (55 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 766 ms. (52 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 845 ms. (47 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 690 ms. (57 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 681 ms. (58 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1.61321e+08 after 3.81321e+09
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :3.81321e+09 after 1.08579e+12
Interrupted probabilistic random walk after 89474 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :1 out of 5
Probabilistic random walk after 89474 steps, saw 86259 distinct states, run finished after 3007 ms. (steps per millisecond=29 ) properties seen :1
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-28 18:21:05] [INFO ] Computed 901 invariants in 93 ms
[2024-05-28 18:21:05] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 170/245 variables, 80/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 170/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2236/2481 variables, 811/1136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2481 variables, 2236/3372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2481 variables, 0/3372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 20/2501 variables, 10/3382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2501 variables, 20/3402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2501 variables, 0/3402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2401/4902 variables, 2501/5903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4902 variables, 4/5907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4902/4902 variables, and 5907 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2084 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 891/891 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 170/245 variables, 80/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 170/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2236/2481 variables, 811/1136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2481 variables, 2236/3372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:21:08] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-28 18:21:08] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
[2024-05-28 18:21:08] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-28 18:21:08] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:21:08] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-28 18:21:08] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-28 18:21:08] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-28 18:21:08] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-05-28 18:21:08] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-28 18:21:08] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-28 18:21:09] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2481 variables, 11/3383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2481 variables, 0/3383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 20/2501 variables, 10/3393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2501 variables, 20/3413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:21:09] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-28 18:21:09] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2501 variables, 2/3415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2501 variables, 0/3415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :1.08579e+12 after 2.23143e+13
At refinement iteration 13 (OVERLAPS) 2401/4902 variables, 2501/5916 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4902 variables, 4/5920 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4902 variables, 4/5924 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:21:14] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 3 ms to minimize.
[2024-05-28 18:21:15] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 3 ms to minimize.
[2024-05-28 18:21:15] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 3 ms to minimize.
[2024-05-28 18:21:15] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 3 ms to minimize.
[2024-05-28 18:21:16] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 4 ms to minimize.
[2024-05-28 18:21:16] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-05-28 18:21:17] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2024-05-28 18:21:17] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 3 ms to minimize.
[2024-05-28 18:21:17] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 2 ms to minimize.
[2024-05-28 18:21:17] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-05-28 18:21:18] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 3 ms to minimize.
[2024-05-28 18:21:18] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 3 ms to minimize.
[2024-05-28 18:21:18] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-05-28 18:21:19] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 5 ms to minimize.
[2024-05-28 18:21:19] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-05-28 18:21:19] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-28 18:21:19] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-28 18:21:20] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-28 18:21:20] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4902 variables, 19/5943 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:21:22] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 2 ms to minimize.
[2024-05-28 18:21:22] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :2.23143e+13 after 5.89999e+15
At refinement iteration 17 (INCLUDED_ONLY) 0/4902 variables, 2/5945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4902 variables, 0/5945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/4902 variables, 0/5945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4902/4902 variables, and 5945 constraints, problems are : Problem set: 0 solved, 4 unsolved in 19263 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 891/891 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 34/34 constraints]
After SMT, in 21504ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 44224 steps, including 994 resets, run visited all 4 properties in 1404 ms. (steps per millisecond=31 )
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 1410 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 39893 ms.

BK_STOP 1716920488198

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="ShieldIIPs-PT-100A"
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-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-100A, 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 r356-tall-171683760500166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100A.tgz
mv ShieldIIPs-PT-100A 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;