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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K 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 49K 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.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 338K 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-040A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716907615165

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-040A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 14:46:56] [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 14:46:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:46:56] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-28 14:46:56] [INFO ] Transformed 1003 places.
[2024-05-28 14:46:56] [INFO ] Transformed 963 transitions.
[2024-05-28 14:46:56] [INFO ] Found NUPN structural information;
[2024-05-28 14:46:56] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (16 resets) in 1980 ms. (20 steps per ms) remains 3/13 properties
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 579 ms. (68 steps per ms) remains 3/3 properties
[2024-05-28 14:46:57] [INFO ] Flatten gal took : 473 ms
BEST_FIRST walk for 40004 steps (8 resets) in 634 ms. (62 steps per ms) remains 3/3 properties
[2024-05-28 14:46:57] [INFO ] Flatten gal took : 151 ms
BEST_FIRST walk for 40004 steps (8 resets) in 555 ms. (71 steps per ms) remains 3/3 properties
[2024-05-28 14:46:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14632610226879909499.gal : 120 ms
[2024-05-28 14:46:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8515978598931652027.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14632610226879909499.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8515978598931652027.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
// Phase 1: matrix 963 rows 1003 cols
[2024-05-28 14:46:58] [INFO ] Computed 361 invariants in 31 ms
Loading property file /tmp/ReachabilityCardinality8515978598931652027.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 100/147 variables, 48/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 100/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 856/1003 variables, 313/508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 856/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :2 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 16
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :16 after 33
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :33 after 66
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :66 after 127
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :127 after 494
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :494 after 25019
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :25019 after 40883
At refinement iteration 8 (OVERLAPS) 963/1966 variables, 1003/2367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :40883 after 84059
At refinement iteration 9 (INCLUDED_ONLY) 0/1966 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :84059 after 949163
At refinement iteration 10 (OVERLAPS) 0/1966 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1966/1966 variables, and 2367 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1105 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 100/147 variables, 48/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 100/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 856/1003 variables, 313/508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 856/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 14:46:59] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 11 ms to minimize.
[2024-05-28 14:46:59] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:46:59] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:46:59] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:46:59] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 5/1369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1003 variables, 0/1369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 963/1966 variables, 1003/2372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1966 variables, 3/2375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Invariant property ShieldIIPs-PT-040A-ReachabilityCardinality-2024-12 does not hold.
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :949163 after 1.61886e+08
[2024-05-28 14:47:01] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:47:01] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:47:01] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.61886e+08 after 2.5757e+08
At refinement iteration 11 (INCLUDED_ONLY) 0/1966 variables, 3/2378 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1966 variables, 0/2378 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1966 variables, 0/2378 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1966/1966 variables, and 2378 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3663 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 4916ms problems are : Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.5757e+08 after 1.10985e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.10985e+10 after 1.10638e+12
Parikh walk visited 0 properties in 4392 ms.
Support contains 30 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 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 1003 transition count 962
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Partial Free-agglomeration rule applied 259 times.
Drop transitions (Partial Free agglomeration) removed 259 transitions
Iterating global reduction 0 with 259 rules applied. Total rules applied 263 place count 1001 transition count 961
Applied a total of 263 rules in 309 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 1001/1003 places, 961/963 transitions.
RANDOM walk for 40000 steps (11 resets) in 1838 ms. (21 steps per ms) remains 1/2 properties
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 394 ms. (101 steps per ms) remains 1/1 properties
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 14:47:08] [INFO ] Computed 361 invariants in 34 ms
[2024-05-28 14:47:08] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 57/81 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 57/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 908/989 variables, 330/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 908/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/989 variables, 0/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/1001 variables, 6/1350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 12/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 961/1962 variables, 1001/2363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1962 variables, 4/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1962/1962 variables, and 2367 constraints, problems are : Problem set: 0 solved, 1 unsolved in 705 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 355/355 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 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/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 57/81 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 57/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 908/989 variables, 330/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 908/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:47:09] [INFO ] Deduced a trap composed of 9 places in 452 ms of which 30 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/989 variables, 1/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/989 variables, 0/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/1001 variables, 6/1351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 12/1363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1001 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 961/1962 variables, 1001/2364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1962 variables, 4/2368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1962 variables, 1/2369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:47:10] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 2 ms to minimize.
[2024-05-28 14:47:11] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.10638e+12 after 2.8263e+13
[2024-05-28 14:47:11] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:47:11] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2024-05-28 14:47:11] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1962 variables, 5/2374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1962 variables, 0/2374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:47:11] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-28 14:47:12] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 8 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/1962 variables, 2/2376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:47:12] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:47:12] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1962 variables, 2/2378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1962 variables, 0/2378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1962 variables, 0/2378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1962/1962 variables, and 2378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3872 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 355/355 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 4660ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1086 ms.
Support contains 24 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 338 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 1001/1001 places, 961/961 transitions.
RANDOM walk for 40000 steps (10 resets) in 604 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 230190 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 1
Probabilistic random walk after 230190 steps, saw 207533 distinct states, run finished after 3004 ms. (steps per millisecond=76 ) properties seen :0
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 14:47:17] [INFO ] Computed 361 invariants in 26 ms
[2024-05-28 14:47:17] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 57/81 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 57/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 908/989 variables, 330/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 908/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/989 variables, 0/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/1001 variables, 6/1350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 12/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 961/1962 variables, 1001/2363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1962 variables, 4/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1962/1962 variables, and 2367 constraints, problems are : Problem set: 0 solved, 1 unsolved in 601 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 355/355 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 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/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 57/81 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 57/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 908/989 variables, 330/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 908/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:47:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/989 variables, 1/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/989 variables, 0/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/1001 variables, 6/1351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 12/1363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1001 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 961/1962 variables, 1001/2364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1962 variables, 4/2368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1962 variables, 1/2369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:47:19] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-05-28 14:47:19] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:47:19] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 5 ms to minimize.
[2024-05-28 14:47:20] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:47:20] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1962 variables, 5/2374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1962 variables, 0/2374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1962 variables, 0/2374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1962/1962 variables, and 2374 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2307 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 355/355 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2989ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1430 ms.
Support contains 24 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 113 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 1001/1001 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 207 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 14:47:22] [INFO ] Invariant cache hit.
[2024-05-28 14:47:23] [INFO ] Implicit Places using invariants in 774 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 811 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1001 places, 961/961 transitions.
Applied a total of 0 rules in 46 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1067 ms. Remains : 1000/1001 places, 961/961 transitions.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.8263e+13 after 5.90048e+15
RANDOM walk for 40000 steps (10 resets) in 1108 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 383 ms. (104 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 245286 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 245286 steps, saw 219789 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
// Phase 1: matrix 961 rows 1000 cols
[2024-05-28 14:47:26] [INFO ] Computed 360 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 57/81 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 57/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 907/988 variables, 329/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/988 variables, 907/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/988 variables, 0/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/1000 variables, 6/1348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1000 variables, 12/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1000 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 961/1961 variables, 1000/2360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1961 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1961 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1961/1961 variables, and 2360 constraints, problems are : Problem set: 0 solved, 1 unsolved in 662 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 354/354 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1000/1000 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/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 57/81 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 57/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 907/988 variables, 329/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/988 variables, 907/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:47:27] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:47:27] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:47:27] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:47:27] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/988 variables, 4/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/988 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/1000 variables, 6/1352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1000 variables, 12/1364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:47:27] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1000 variables, 1/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1000 variables, 0/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 961/1961 variables, 1000/2365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1961 variables, 1/2366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:47:28] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:47:28] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:47:29] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:47:29] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1961 variables, 4/2370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:47:29] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 4 ms to minimize.
[2024-05-28 14:47:29] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1961 variables, 2/2372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:47:29] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1961 variables, 1/2373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:47:29] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1961 variables, 1/2374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:47:30] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1961 variables, 1/2375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1961 variables, 0/2375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1961 variables, 0/2375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1961/1961 variables, and 2375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3213 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 354/354 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 3904ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1144 ms.
Support contains 24 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 28 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1000/1000 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 26 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 14:47:31] [INFO ] Invariant cache hit.
[2024-05-28 14:47:32] [INFO ] Implicit Places using invariants in 691 ms returned []
[2024-05-28 14:47:32] [INFO ] Invariant cache hit.
[2024-05-28 14:47:34] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2267 ms to find 0 implicit places.
[2024-05-28 14:47:34] [INFO ] Redundant transitions in 56 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-28 14:47:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 6/1005 constraints. Problems are: Problem set: 0 solved, 960 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :5.90048e+15 after 1.1527e+17
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 1/1000 variables, 354/1359 constraints. Problems are: Problem set: 0 solved, 960 unsolved
SMT process timed out in 30796ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 30808ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33173 ms. Remains : 1000/1000 places, 961/961 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 14:48:05] [INFO ] Flatten gal took : 69 ms
[2024-05-28 14:48:05] [INFO ] Applying decomposition
[2024-05-28 14:48:05] [INFO ] Flatten gal took : 64 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/graph220012964381727836.txt' '-o' '/tmp/graph220012964381727836.bin' '-w' '/tmp/graph220012964381727836.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph220012964381727836.bin' '-l' '-1' '-v' '-w' '/tmp/graph220012964381727836.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:48:05] [INFO ] Decomposing Gal with order
[2024-05-28 14:48:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:48:05] [INFO ] Removed a total of 640 redundant transitions.
[2024-05-28 14:48:05] [INFO ] Flatten gal took : 135 ms
[2024-05-28 14:48:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 616 labels/synchronizations in 105 ms.
[2024-05-28 14:48:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17137290955344392924.gal : 19 ms
[2024-05-28 14:48:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15743232227754929961.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/ReachabilityCardinality17137290955344392924.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15743232227754929961.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/ReachabilityCardinality15743232227754929961.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 79
ITS-tools command line returned an error code 137
[2024-05-28 15:10:35] [INFO ] Flatten gal took : 88 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16332028598459941418
[2024-05-28 15:10:35] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2024-05-28 15:10:35] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:10:35] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2024-05-28 15:10:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:10:35] [INFO ] Applying decomposition
[2024-05-28 15:10:36] [INFO ] Flatten gal took : 144 ms
[2024-05-28 15:10:36] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2024-05-28 15:10:36] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:10:36] [INFO ] Built C files in 537ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16332028598459941418
Running compilation step : cd /tmp/ltsmin16332028598459941418;'/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'
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/graph15505967316349465565.txt' '-o' '/tmp/graph15505967316349465565.bin' '-w' '/tmp/graph15505967316349465565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15505967316349465565.bin' '-l' '-1' '-v' '-w' '/tmp/graph15505967316349465565.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:10:36] [INFO ] Decomposing Gal with order
[2024-05-28 15:10:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:10:36] [INFO ] Removed a total of 773 redundant transitions.
[2024-05-28 15:10:36] [INFO ] Flatten gal took : 166 ms
[2024-05-28 15:10:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 984 labels/synchronizations in 106 ms.
[2024-05-28 15:10:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8140414282689109794.gal : 26 ms
[2024-05-28 15:10:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9877304926037085116.prop : 75 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/ReachabilityCardinality8140414282689109794.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9877304926037085116.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 ...307
Loading property file /tmp/ReachabilityCardinality9877304926037085116.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2 after 2
Compilation finished in 4398 ms.
Running link step : cd /tmp/ltsmin16332028598459941418;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin16332028598459941418;'/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' 'ShieldIIPsPT040AReachabilityCardinality202414==true'
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :273529 after 8.83102e+30
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.83102e+30 after 3.16411e+51
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.052: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.053: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.052: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.053: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.052: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.053: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.052: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.053: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.200: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.411: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.465: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.505: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 1.669: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 1.669: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.021: Initializing POR dependencies: labels 962, guards 961
pins2lts-mc-linux64( 7/ 8), 3.284: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 33.680: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 2/ 8), 35.523: "ShieldIIPsPT040AReachabilityCardinality202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 35.523: "ShieldIIPsPT040AReachabilityCardinality202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 35.524: "ShieldIIPsPT040AReachabilityCardinality202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 35.524: "ShieldIIPsPT040AReachabilityCardinality202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 35.527: "ShieldIIPsPT040AReachabilityCardinality202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 35.525: "ShieldIIPsPT040AReachabilityCardinality202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 35.525: "ShieldIIPsPT040AReachabilityCardinality202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 35.526: "ShieldIIPsPT040AReachabilityCardinality202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 35.528: There are 962 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 35.528: State length is 1000, there are 961 groups
pins2lts-mc-linux64( 0/ 8), 35.528: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 35.528: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 35.528: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 35.528: Visible groups: 0 / 961, labels: 1 / 962
pins2lts-mc-linux64( 0/ 8), 35.528: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 35.528: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 35.665: ~4 levels ~960 states ~3248 transitions
pins2lts-mc-linux64( 0/ 8), 35.767: ~13 levels ~1920 states ~7976 transitions
pins2lts-mc-linux64( 5/ 8), 35.997: ~6 levels ~3840 states ~15864 transitions
pins2lts-mc-linux64( 5/ 8), 36.386: ~7 levels ~7680 states ~34816 transitions
pins2lts-mc-linux64( 1/ 8), 37.150: ~11 levels ~15360 states ~85056 transitions
pins2lts-mc-linux64( 1/ 8), 38.639: ~12 levels ~30720 states ~177960 transitions
pins2lts-mc-linux64( 1/ 8), 41.624: ~13 levels ~61440 states ~367904 transitions
pins2lts-mc-linux64( 1/ 8), 47.554: ~14 levels ~122880 states ~765776 transitions
pins2lts-mc-linux64( 1/ 8), 59.515: ~15 levels ~245760 states ~1590104 transitions
pins2lts-mc-linux64( 1/ 8), 83.883: ~16 levels ~491520 states ~3343336 transitions
pins2lts-mc-linux64( 1/ 8), 134.272: ~17 levels ~983040 states ~6898504 transitions
pins2lts-mc-linux64( 1/ 8), 240.233: ~18 levels ~1966080 states ~14698704 transitions
pins2lts-mc-linux64( 1/ 8), 494.917: ~19 levels ~3932160 states ~30561904 transitions
pins2lts-mc-linux64( 1/ 8), 1149.934: ~20 levels ~7864320 states ~63698784 transitions
pins2lts-mc-linux64( 5/ 8), 1282.140: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1282.312:
pins2lts-mc-linux64( 0/ 8), 1282.318: mean standard work distribution: 4.1% (states) 4.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 1282.318:
pins2lts-mc-linux64( 0/ 8), 1282.318: Explored 7900760 states 62191287 transitions, fanout: 7.872
pins2lts-mc-linux64( 0/ 8), 1282.318: Total exploration time 1246.760 sec (1246.650 sec minimum, 1246.695 sec on average)
pins2lts-mc-linux64( 0/ 8), 1282.318: States per second: 6337, Transitions per second: 49882
pins2lts-mc-linux64( 0/ 8), 1282.318: Ignoring proviso: 3936629
pins2lts-mc-linux64( 0/ 8), 1282.318:
pins2lts-mc-linux64( 0/ 8), 1282.318: Queue width: 8B, total height: 6877958, memory: 52.47MB
pins2lts-mc-linux64( 0/ 8), 1282.318: Tree memory: 368.8MB, 26.2 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1282.318: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1282.318: Stored 968 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1282.318: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1282.318: Est. total memory use: 421.2MB (~1076.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16332028598459941418;'/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' 'ShieldIIPsPT040AReachabilityCardinality202414==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16332028598459941418;'/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' 'ShieldIIPsPT040AReachabilityCardinality202414==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)
Detected timeout of ITS tools.
[2024-05-28 15:38:30] [INFO ] Applying decomposition
[2024-05-28 15:38:30] [INFO ] Flatten gal took : 88 ms
[2024-05-28 15:38:30] [INFO ] Decomposing Gal with order
[2024-05-28 15:38:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:38:30] [INFO ] Removed a total of 901 redundant transitions.
[2024-05-28 15:38:30] [INFO ] Flatten gal took : 98 ms
[2024-05-28 15:38:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 820 labels/synchronizations in 73 ms.
[2024-05-28 15:38:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4176037943425892578.gal : 24 ms
[2024-05-28 15:38:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3969954300814955537.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/ReachabilityCardinality4176037943425892578.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3969954300814955537.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 ...307
Loading property file /tmp/ReachabilityCardinality3969954300814955537.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 8
ITS-tools command line returned an error code 137
[2024-05-28 15:45:54] [INFO ] Flatten gal took : 54 ms
[2024-05-28 15:45:54] [INFO ] Input system was already deterministic with 961 transitions.
[2024-05-28 15:45:54] [INFO ] Transformed 1000 places.
[2024-05-28 15:45:54] [INFO ] Transformed 961 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-28 15:45:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12172689073194281476.gal : 11 ms
[2024-05-28 15:45:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6427012207446954683.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12172689073194281476.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6427012207446954683.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/ReachabilityCardinality6427012207446954683.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 35
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :35 after 117
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :117 after 1425
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1425 after 2380
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2380 after 5855
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5855 after 42116
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :42116 after 415713
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :415713 after 5.17073e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.17073e+06 after 9.26735e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :9.26735e+06 after 3.10743e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.10743e+07 after 5.2779e+08
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :5.2779e+08 after 8.9895e+08
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :8.9895e+08 after 7.76119e+09
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :7.76119e+09 after 2.26617e+11

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="ShieldIIPs-PT-040A"
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-040A, 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-171683760400134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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