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-171683762000854.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 ShieldRVs-PT-050A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762000854
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 320K 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 ShieldRVs-PT-050A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717063289204

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-30 10:01:30] [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-30 10:01:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 10:01:30] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-30 10:01:30] [INFO ] Transformed 703 places.
[2024-05-30 10:01:30] [INFO ] Transformed 953 transitions.
[2024-05-30 10:01:30] [INFO ] Found NUPN structural information;
[2024-05-30 10:01:30] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (57 resets) in 2096 ms. (19 steps per ms) remains 7/14 properties
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 10:01:31] [INFO ] Flatten gal took : 340 ms
BEST_FIRST walk for 40004 steps (8 resets) in 717 ms. (55 steps per ms) remains 7/7 properties
[2024-05-30 10:01:31] [INFO ] Flatten gal took : 237 ms
BEST_FIRST walk for 40004 steps (8 resets) in 617 ms. (64 steps per ms) remains 7/7 properties
[2024-05-30 10:01:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6953632755838537204.gal : 75 ms
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 7/7 properties
[2024-05-30 10:01:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12431928051997904030.prop : 6 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/ReachabilityCardinality6953632755838537204.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12431928051997904030.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 ...329
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 279 ms. (142 steps per ms) remains 6/7 properties
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Loading property file /tmp/ReachabilityCardinality12431928051997904030.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 6/6 properties
// Phase 1: matrix 953 rows 703 cols
[2024-05-30 10:01:32] [INFO ] Computed 201 invariants in 27 ms
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :36 after 69
Reachability property ShieldRVs-PT-050A-ReachabilityCardinality-2024-14 is true.
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :69 after 136
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :136 after 873
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :873 after 5499
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :5499 after 57889
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 1024
At refinement iteration 2 (OVERLAPS) 213/323 variables, 88/198 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SDD size :57889 after 720104
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 213/411 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/411 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 380/703 variables, 113/524 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 380/904 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 0/904 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :720104 after 6.55313e+06
At refinement iteration 8 (OVERLAPS) 953/1656 variables, 703/1607 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1656 variables, 0/1607 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1656 variables, 0/1607 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1656/1656 variables, and 1607 constraints, problems are : Problem set: 1 solved, 5 unsolved in 960 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 703/703 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem ShieldRVs-PT-050A-ReachabilityCardinality-2024-12 is UNSAT
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 215/323 variables, 88/196 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 215/411 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/411 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 380/703 variables, 113/524 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 380/904 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-30 10:01:33] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 18 ms to minimize.
[2024-05-30 10:01:33] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :6.55313e+06 after 6.11101e+08
[2024-05-30 10:01:33] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-30 10:01:33] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-30 10:01:34] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-30 10:01:34] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-05-30 10:01:34] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 3 ms to minimize.
[2024-05-30 10:01:34] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-30 10:01:34] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-05-30 10:01:34] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:01:34] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:01:34] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2024-05-30 10:01:34] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-30 10:01:34] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 20/924 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 8/932 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-30 10:01:35] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 2/934 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/703 variables, 0/934 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 953/1656 variables, 703/1637 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1656 variables, 4/1641 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-30 10:01:37] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-30 10:01:37] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-30 10:01:37] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2024-05-30 10:01:37] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 5 ms to minimize.
[2024-05-30 10:01:37] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-30 10:01:38] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:01:38] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
SMT process timed out in 6182ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 93 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 67 times.
Drop transitions (Partial Free agglomeration) removed 67 transitions
Iterating global reduction 0 with 67 rules applied. Total rules applied 69 place count 702 transition count 952
Applied a total of 69 rules in 183 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 702/703 places, 952/953 transitions.
RANDOM walk for 40000 steps (63 resets) in 640 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 309 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 267 ms. (149 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 185451 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 4
Probabilistic random walk after 185451 steps, saw 45242 distinct states, run finished after 3005 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 10:01:42] [INFO ] Computed 201 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 196/289 variables, 79/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 196/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 413/702 variables, 122/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 413/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 952/1654 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 1605 constraints, problems are : Problem set: 0 solved, 4 unsolved in 684 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 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/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 196/289 variables, 79/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 196/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 10:01:42] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 10:01:42] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 10:01:42] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 413/702 variables, 122/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 413/906 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 10:01:43] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:01:43] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-05-30 10:01:43] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:01:43] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-05-30 10:01:43] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:01:43] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-30 10:01:43] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 20/926 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 10:01:44] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 2/928 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 952/1654 variables, 702/1630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1654 variables, 4/1634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 10:01:46] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-30 10:01:46] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
[2024-05-30 10:01:46] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-30 10:01:46] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-30 10:01:46] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-30 10:01:46] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-30 10:01:46] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 10:01:46] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 10:01:47] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 10:01:47] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-30 10:01:47] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1654 variables, 11/1645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1654 variables, 0/1645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1654 variables, 0/1645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 1645 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5812 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 36/36 constraints]
After SMT, in 6549ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 1233 ms.
Support contains 23 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 702 transition count 952
Applied a total of 27 rules in 95 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 702/702 places, 952/952 transitions.
RANDOM walk for 40000 steps (67 resets) in 350 ms. (113 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 238697 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 238697 steps, saw 54239 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 10:01:53] [INFO ] Computed 201 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 60/83 variables, 21/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 60/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 619/702 variables, 180/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 619/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 952/1654 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 1605 constraints, problems are : Problem set: 0 solved, 1 unsolved in 398 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 60/83 variables, 21/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 60/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 619/702 variables, 180/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 619/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:01:53] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-05-30 10:01:53] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-30 10:01:54] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-30 10:01:54] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-30 10:01:54] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-30 10:01:54] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-30 10:01:54] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-30 10:01:54] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-30 10:01:54] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-30 10:01:54] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2024-05-30 10:01:54] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:01:54] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2024-05-30 10:01:54] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:01:54] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:01:55] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-30 10:01:55] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-30 10:01:55] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-30 10:01:55] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 10:01:55] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 19/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 952/1654 variables, 702/1624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1654 variables, 1/1625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:01:55] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-05-30 10:01:56] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-30 10:01:56] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2024-05-30 10:01:56] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2024-05-30 10:01:56] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-05-30 10:01:56] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-30 10:01:56] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2024-05-30 10:01:56] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2024-05-30 10:01:57] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-30 10:01:57] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-30 10:01:57] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:01:57] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-30 10:01:57] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-30 10:01:57] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:01:57] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-30 10:01:57] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-30 10:01:57] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-30 10:01:58] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-30 10:01:58] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-30 10:01:58] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1654 variables, 20/1645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 10:01:58] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-30 10:01:58] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:01:58] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-30 10:01:58] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2024-05-30 10:01:58] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-30 10:01:58] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2024-05-30 10:01:58] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-30 10:01:59] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2024-05-30 10:01:59] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-05-30 10:01:59] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-30 10:01:59] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 10:01:59] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-30 10:01:59] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-30 10:01:59] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1654 variables, 14/1659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1654 variables, 0/1659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1654 variables, 0/1659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 1659 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6324 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 53/53 constraints]
After SMT, in 6752ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 594 ms.
Support contains 23 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 29 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 32 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2024-05-30 10:02:00] [INFO ] Invariant cache hit.
[2024-05-30 10:02:00] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-30 10:02:00] [INFO ] Invariant cache hit.
[2024-05-30 10:02:01] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
[2024-05-30 10:02:02] [INFO ] Redundant transitions in 197 ms returned []
Running 951 sub problems to find dead transitions.
[2024-05-30 10:02:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-05-30 10:02:32] [INFO ] Deduced a trap composed of 7 places in 1261 ms of which 3 ms to minimize.
[2024-05-30 10:02:32] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 3 ms to minimize.
[2024-05-30 10:02:32] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 3 ms to minimize.
[2024-05-30 10:02:33] [INFO ] Deduced a trap composed of 7 places in 942 ms of which 3 ms to minimize.
SMT process timed out in 31577ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 31607ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33193 ms. Remains : 702/702 places, 952/952 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 10:02:33] [INFO ] Flatten gal took : 101 ms
[2024-05-30 10:02:33] [INFO ] Applying decomposition
[2024-05-30 10:02:33] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16766849404622227663.txt' '-o' '/tmp/graph16766849404622227663.bin' '-w' '/tmp/graph16766849404622227663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16766849404622227663.bin' '-l' '-1' '-v' '-w' '/tmp/graph16766849404622227663.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:02:34] [INFO ] Decomposing Gal with order
[2024-05-30 10:02:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:02:34] [INFO ] Removed a total of 1047 redundant transitions.
[2024-05-30 10:02:34] [INFO ] Flatten gal took : 123 ms
[2024-05-30 10:02:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 832 labels/synchronizations in 98 ms.
[2024-05-30 10:02:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18390715146179124476.gal : 11 ms
[2024-05-30 10:02:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12071082773983244532.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18390715146179124476.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12071082773983244532.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality12071082773983244532.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 38
ITS-tools command line returned an error code 137
[2024-05-30 10:08:57] [INFO ] Flatten gal took : 50 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6816642702425625406
[2024-05-30 10:08:57] [INFO ] Applying decomposition
[2024-05-30 10:08:57] [INFO ] Computing symmetric may disable matrix : 952 transitions.
[2024-05-30 10:08:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 10:08:57] [INFO ] Computing symmetric may enable matrix : 952 transitions.
[2024-05-30 10:08:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 10:08:57] [INFO ] Flatten gal took : 99 ms
[2024-05-30 10:08:57] [INFO ] Computing Do-Not-Accords matrix : 952 transitions.
[2024-05-30 10:08:57] [INFO ] Computation of Completed DNA matrix. took 32 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.202405141337/bin/convert-linux64' '-i' '/tmp/graph9234681465874958190.txt' '-o' '/tmp/graph9234681465874958190.bin' '-w' '/tmp/graph9234681465874958190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9234681465874958190.bin' '-l' '-1' '-v' '-w' '/tmp/graph9234681465874958190.weights' '-q' '0' '-e' '0.001'
[2024-05-30 10:08:57] [INFO ] Built C files in 357ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6816642702425625406
Running compilation step : cd /tmp/ltsmin6816642702425625406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-30 10:08:57] [INFO ] Decomposing Gal with order
[2024-05-30 10:08:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:08:57] [INFO ] Removed a total of 1091 redundant transitions.
[2024-05-30 10:08:57] [INFO ] Flatten gal took : 146 ms
[2024-05-30 10:08:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 939 labels/synchronizations in 43 ms.
[2024-05-30 10:08:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14597181287685428667.gal : 7 ms
[2024-05-30 10:08:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14945107504290943708.prop : 18 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/ReachabilityCardinality14597181287685428667.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14945107504290943708.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality14945107504290943708.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7 after 16956
Compilation finished in 3852 ms.
Running link step : cd /tmp/ltsmin6816642702425625406;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin6816642702425625406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT050AReachabilityCardinality202402==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.216: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.216: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.216: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.217: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.217: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.217: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.217: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.222: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.222: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.226: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.226: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.228: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.228: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.232: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.232: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.258: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.258: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.880: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.883: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 1.163: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.179: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.179: Initializing POR dependencies: labels 953, guards 952
pins2lts-mc-linux64( 1/ 8), 1.183: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 1.196: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 1.210: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 1.269: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 20.039: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 0/ 8), 20.438: "ShieldRVsPT050AReachabilityCardinality202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 20.439: There are 953 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 20.439: State length is 702, there are 952 groups
pins2lts-mc-linux64( 0/ 8), 20.439: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 20.439: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 20.439: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 20.439: Visible groups: 0 / 952, labels: 1 / 953
pins2lts-mc-linux64( 0/ 8), 20.439: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 20.439: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 20.440: "ShieldRVsPT050AReachabilityCardinality202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 20.440: "ShieldRVsPT050AReachabilityCardinality202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 20.443: "ShieldRVsPT050AReachabilityCardinality202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 20.442: "ShieldRVsPT050AReachabilityCardinality202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 20.442: "ShieldRVsPT050AReachabilityCardinality202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 20.442: "ShieldRVsPT050AReachabilityCardinality202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 20.441: "ShieldRVsPT050AReachabilityCardinality202402==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 20.505: ~10 levels ~960 states ~3704 transitions
pins2lts-mc-linux64( 0/ 8), 20.604: ~13 levels ~1920 states ~8888 transitions
pins2lts-mc-linux64( 0/ 8), 20.782: ~14 levels ~3840 states ~20488 transitions
pins2lts-mc-linux64( 4/ 8), 21.183: ~6 levels ~7680 states ~42456 transitions
pins2lts-mc-linux64( 4/ 8), 21.799: ~7 levels ~15360 states ~92472 transitions
pins2lts-mc-linux64( 4/ 8), 22.991: ~8 levels ~30720 states ~188264 transitions
pins2lts-mc-linux64( 4/ 8), 25.370: ~9 levels ~61440 states ~406224 transitions
pins2lts-mc-linux64( 7/ 8), 30.072: ~10 levels ~122880 states ~821984 transitions
pins2lts-mc-linux64( 7/ 8), 39.898: ~11 levels ~245760 states ~1757768 transitions
pins2lts-mc-linux64( 7/ 8), 58.765: ~12 levels ~491520 states ~3626080 transitions
pins2lts-mc-linux64( 7/ 8), 102.074: ~13 levels ~983040 states ~7635768 transitions
pins2lts-mc-linux64( 7/ 8), 183.100: ~14 levels ~1966080 states ~15731648 transitions
pins2lts-mc-linux64( 5/ 8), 353.682: ~15 levels ~3932160 states ~33693080 transitions
pins2lts-mc-linux64( 1/ 8), 493.822: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 493.968:
pins2lts-mc-linux64( 0/ 8), 493.968: mean standard work distribution: 4.1% (states) 3.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 493.969:
pins2lts-mc-linux64( 0/ 8), 493.969: Explored 5145583 states 44870918 transitions, fanout: 8.720
pins2lts-mc-linux64( 0/ 8), 493.969: Total exploration time 473.520 sec (473.380 sec minimum, 473.427 sec on average)
pins2lts-mc-linux64( 0/ 8), 493.969: States per second: 10867, Transitions per second: 94760
pins2lts-mc-linux64( 0/ 8), 493.969: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 493.969:
pins2lts-mc-linux64( 0/ 8), 493.969: Queue width: 8B, total height: 5342854, memory: 40.76MB
pins2lts-mc-linux64( 0/ 8), 493.969: Tree memory: 336.0MB, 33.6 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 493.969: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 493.969: Stored 959 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 493.969: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 493.969: Est. total memory use: 376.8MB (~1064.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6816642702425625406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT050AReachabilityCardinality202402==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6816642702425625406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT050AReachabilityCardinality202402==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-30 10:21:10] [INFO ] Applying decomposition
[2024-05-30 10:21:10] [INFO ] Flatten gal took : 41 ms
[2024-05-30 10:21:10] [INFO ] Decomposing Gal with order
[2024-05-30 10:21:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 10:21:10] [INFO ] Removed a total of 1141 redundant transitions.
[2024-05-30 10:21:10] [INFO ] Flatten gal took : 64 ms
[2024-05-30 10:21:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 743 labels/synchronizations in 23 ms.
[2024-05-30 10:21:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15744565733480465063.gal : 32 ms
[2024-05-30 10:21:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18221907725253351878.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/ReachabilityCardinality15744565733480465063.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18221907725253351878.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality18221907725253351878.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 6820
Detected timeout of ITS tools.
[2024-05-30 10:43:39] [INFO ] Flatten gal took : 50 ms
[2024-05-30 10:43:39] [INFO ] Input system was already deterministic with 952 transitions.
[2024-05-30 10:43:39] [INFO ] Transformed 702 places.
[2024-05-30 10:43:39] [INFO ] Transformed 952 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 10:43:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17556047385504486776.gal : 7 ms
[2024-05-30 10:43:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4351766547380609995.prop : 18 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/ReachabilityCardinality17556047385504486776.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4351766547380609995.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...374
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality4351766547380609995.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 40
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :40 after 73
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :73 after 145
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :145 after 297
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :297 after 847
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :847 after 2205
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2205 after 9742
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9742 after 119141
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :119141 after 459580
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :459580 after 1.53576e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.53576e+06 after 7.02896e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :7.02896e+06 after 5.19387e+08
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :5.19387e+08 after 6.00021e+10
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :6.00021e+10 after 4.23214e+14
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :4.23214e+14 after 1.55642e+35

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
+ 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="ShieldRVs-PT-050A"
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 ShieldRVs-PT-050A, 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-171683762000854"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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