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.r355-tall-171683758000103.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 greatspnxred
Input is ShieldIIPs-PT-020A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758000103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 14:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 14:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 11 14:45 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 169K 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-020A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-020A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716894904132

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 11:15:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 11:15:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:15:05] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-28 11:15:05] [INFO ] Transformed 503 places.
[2024-05-28 11:15:05] [INFO ] Transformed 483 transitions.
[2024-05-28 11:15:05] [INFO ] Found NUPN structural information;
[2024-05-28 11:15:05] [INFO ] Parsed PT model containing 503 places and 483 transitions and 2166 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (36 resets) in 1609 ms. (24 steps per ms) remains 3/16 properties
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1060 ms. (37 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 3/3 properties
// Phase 1: matrix 483 rows 503 cols
[2024-05-28 11:15:06] [INFO ] Computed 181 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 204/384 variables, 128/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 204/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 119/503 variables, 53/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 119/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 483/986 variables, 503/1187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/986 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/986 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 986/986 variables, and 1187 constraints, problems are : Problem set: 0 solved, 3 unsolved in 995 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 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/180 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 204/384 variables, 128/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 204/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 119/503 variables, 53/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 119/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 483/986 variables, 503/1187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/986 variables, 3/1190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/986 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 11:15:10] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 11 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/986 variables, 1/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/986 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/986 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 986/986 variables, and 1191 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4187 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 5347ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA ShieldIIPs-PT-020A-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2733 ms.
Support contains 143 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 483/483 transitions.
Partial Free-agglomeration rule applied 84 times.
Drop transitions (Partial Free agglomeration) removed 84 transitions
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 503 transition count 483
Applied a total of 84 rules in 73 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 503/503 places, 483/483 transitions.
RANDOM walk for 40000 steps (30 resets) in 1363 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 241722 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 241722 steps, saw 178858 distinct states, run finished after 3011 ms. (steps per millisecond=80 ) properties seen :0
// Phase 1: matrix 483 rows 503 cols
[2024-05-28 11:15:18] [INFO ] Computed 181 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 143/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 175/318 variables, 103/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 175/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 181/499 variables, 76/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 181/678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/503 variables, 2/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 4/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 483/986 variables, 503/1187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/986 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/986 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 986/986 variables, and 1187 constraints, problems are : Problem set: 0 solved, 2 unsolved in 462 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 179/179 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 143/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 175/318 variables, 103/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 175/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 181/499 variables, 76/498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 181/679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:15:19] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/503 variables, 2/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 4/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 483/986 variables, 503/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/986 variables, 2/1192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 11:15:20] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:15:20] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/986 variables, 2/1194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/986 variables, 0/1194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/986 variables, 0/1194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 986/986 variables, and 1194 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2503 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 179/179 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 3031ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1547 ms.
Support contains 143 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 30 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 503/503 places, 483/483 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 19 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-05-28 11:15:23] [INFO ] Invariant cache hit.
[2024-05-28 11:15:23] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-28 11:15:23] [INFO ] Invariant cache hit.
[2024-05-28 11:15:23] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2024-05-28 11:15:23] [INFO ] Redundant transitions in 55 ms returned []
Running 482 sub problems to find dead transitions.
[2024-05-28 11:15:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (OVERLAPS) 1/503 variables, 179/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:15:34] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
[2024-05-28 11:15:35] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:15:35] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-05-28 11:15:36] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-28 11:15:36] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-28 11:15:36] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-28 11:15:36] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-28 11:15:36] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-28 11:15:36] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-28 11:15:37] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-28 11:15:37] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-28 11:15:37] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-28 11:15:37] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-28 11:15:37] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-28 11:15:37] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:15:37] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-28 11:15:37] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:15:38] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:15:38] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-28 11:15:38] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:15:38] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-28 11:15:38] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:15:41] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-28 11:15:41] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:15:41] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:15:41] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-28 11:15:42] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 7/711 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 8 (OVERLAPS) 483/986 variables, 503/1214 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:15:50] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 5 ms to minimize.
[2024-05-28 11:15:50] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:15:50] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:15:51] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:15:51] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:15:51] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 3 ms to minimize.
[2024-05-28 11:15:51] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 1221 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30020 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 179/179 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (OVERLAPS) 1/503 variables, 179/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 34/718 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (OVERLAPS) 483/986 variables, 503/1221 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/986 variables, 482/1703 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:16:11] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:16:11] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 1705 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30015 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 179/179 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 36/36 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61039 ms. Remains : 503/503 places, 483/483 transitions.
[2024-05-28 11:16:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 13 ms.
[2024-05-28 11:16:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 503 places, 483 transitions and 2346 arcs took 10 ms.
[2024-05-28 11:16:24] [INFO ] Flatten gal took : 86 ms
Total runtime 79133 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-020A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 503
TRANSITIONS: 483
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.008s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 701
MODEL NAME: /home/mcc/execution/412/model
503 places, 483 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 33554432 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 33554432 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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-020A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldIIPs-PT-020A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758000103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020A.tgz
mv ShieldIIPs-PT-020A execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;