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.r373-tall-171683788500084.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 gold2023
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 r373-tall-171683788500084
=====================================================================

--------------------
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 1716942019716

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040A
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 00:20:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 00:20:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 00:20:21] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-29 00:20:21] [INFO ] Transformed 1003 places.
[2024-05-29 00:20:21] [INFO ] Transformed 963 transitions.
[2024-05-29 00:20:21] [INFO ] Found NUPN structural information;
[2024-05-29 00:20:21] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 205 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
Incomplete random walk after 10000 steps, including 4 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 13) seen :10
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-29 00:20:31] [INFO ] Computed 361 invariants in 25 ms
[2024-05-29 00:20:31] [INFO ] [Real]Absence check using 361 positive place invariants in 71 ms returned sat
[2024-05-29 00:20:31] [INFO ] After 498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 00:20:32] [INFO ] [Nat]Absence check using 361 positive place invariants in 62 ms returned sat
[2024-05-29 00:20:33] [INFO ] After 1359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 00:20:33] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 7 ms to minimize.
[2024-05-29 00:20:33] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-29 00:20:33] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 00:20:33] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-29 00:20:34] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-29 00:20:34] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2024-05-29 00:20:34] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2024-05-29 00:20:34] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2024-05-29 00:20:34] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-29 00:20:34] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 00:20:34] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-29 00:20:34] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-29 00:20:34] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-29 00:20:35] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2024-05-29 00:20:35] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1730 ms
[2024-05-29 00:20:35] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2024-05-29 00:20:35] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 00:20:35] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-29 00:20:35] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 00:20:36] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-29 00:20:36] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-29 00:20:36] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-29 00:20:36] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-29 00:20:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 885 ms
[2024-05-29 00:20:36] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 00:20:37] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-29 00:20:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
[2024-05-29 00:20:37] [INFO ] After 5031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 939 ms.
[2024-05-29 00:20:38] [INFO ] After 6316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 462 ms.
Support contains 47 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 5 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 7 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 254 times.
Drop transitions removed 254 transitions
Iterating global reduction 0 with 254 rules applied. Total rules applied 258 place count 1001 transition count 961
Applied a total of 258 rules in 271 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 272 ms. Remains : 1001/1003 places, 961/963 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :2
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-29 00:20:39] [INFO ] Computed 361 invariants in 41 ms
[2024-05-29 00:20:39] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:20:39] [INFO ] [Nat]Absence check using 353 positive place invariants in 69 ms returned sat
[2024-05-29 00:20:39] [INFO ] [Nat]Absence check using 353 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-29 00:20:40] [INFO ] After 871ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:20:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 00:20:40] [INFO ] After 345ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:20:41] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2024-05-29 00:20:41] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2024-05-29 00:20:41] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 00:20:41] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-29 00:20:41] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2024-05-29 00:20:41] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-29 00:20:42] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-05-29 00:20:42] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2024-05-29 00:20:42] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2024-05-29 00:20:42] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 00:20:42] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-29 00:20:42] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 00:20:42] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1944 ms
[2024-05-29 00:20:42] [INFO ] After 2513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 241 ms.
[2024-05-29 00:20:43] [INFO ] After 3871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 57 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 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 1001 transition count 961
Applied a total of 9 rules in 332 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 333 ms. Remains : 1001/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 211044 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211044 steps, saw 191977 distinct states, run finished after 3003 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-29 00:20:46] [INFO ] Computed 361 invariants in 43 ms
[2024-05-29 00:20:47] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:20:47] [INFO ] [Nat]Absence check using 355 positive place invariants in 61 ms returned sat
[2024-05-29 00:20:47] [INFO ] [Nat]Absence check using 355 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-29 00:20:48] [INFO ] After 792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:20:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 00:20:48] [INFO ] After 287ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:20:48] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2024-05-29 00:20:48] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2024-05-29 00:20:49] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2024-05-29 00:20:49] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-05-29 00:20:49] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-29 00:20:49] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-05-29 00:20:49] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-29 00:20:50] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-29 00:20:50] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 0 ms to minimize.
[2024-05-29 00:20:50] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2024-05-29 00:20:50] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2024-05-29 00:20:50] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 00:20:50] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 00:20:50] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-29 00:20:50] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 00:20:51] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 00:20:51] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2573 ms
[2024-05-29 00:20:51] [INFO ] After 3072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 403 ms.
[2024-05-29 00:20:51] [INFO ] After 4547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 56 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 30 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 31 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 33 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:20:51] [INFO ] Invariant cache hit.
[2024-05-29 00:20:52] [INFO ] Implicit Places using invariants in 760 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 763 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 26 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 824 ms. Remains : 1000/1001 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 225981 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 225981 steps, saw 204352 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1000 cols
[2024-05-29 00:20:55] [INFO ] Computed 360 invariants in 24 ms
[2024-05-29 00:20:55] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:20:56] [INFO ] [Nat]Absence check using 354 positive place invariants in 68 ms returned sat
[2024-05-29 00:20:56] [INFO ] [Nat]Absence check using 354 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-29 00:20:57] [INFO ] After 937ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:20:57] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-29 00:20:57] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 00:20:58] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 00:20:58] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 0 ms to minimize.
[2024-05-29 00:20:58] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-29 00:20:58] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-29 00:20:58] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-29 00:20:59] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2024-05-29 00:20:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1475 ms
[2024-05-29 00:20:59] [INFO ] After 2974ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 297 ms.
[2024-05-29 00:20:59] [INFO ] After 3546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 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 30 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 30 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 27 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-29 00:20:59] [INFO ] Invariant cache hit.
[2024-05-29 00:21:00] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-05-29 00:21:00] [INFO ] Invariant cache hit.
[2024-05-29 00:21:01] [INFO ] Implicit Places using invariants and state equation in 1641 ms returned []
Implicit Place search using SMT with State Equation took 2358 ms to find 0 implicit places.
[2024-05-29 00:21:01] [INFO ] Redundant transitions in 56 ms returned []
[2024-05-29 00:21:01] [INFO ] Invariant cache hit.
[2024-05-29 00:21:02] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3121 ms. Remains : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 24 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 00:21:02] [INFO ] Invariant cache hit.
[2024-05-29 00:21:02] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:21:03] [INFO ] [Nat]Absence check using 354 positive place invariants in 66 ms returned sat
[2024-05-29 00:21:03] [INFO ] [Nat]Absence check using 354 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-29 00:21:04] [INFO ] After 1252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:21:04] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 00:21:04] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 00:21:05] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 00:21:05] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-29 00:21:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 617 ms
[2024-05-29 00:21:05] [INFO ] After 2230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 324 ms.
[2024-05-29 00:21:05] [INFO ] After 2825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:21:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-29 00:21:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1000 places, 961 transitions and 4878 arcs took 7 ms.
[2024-05-29 00:21:06] [INFO ] Flatten gal took : 180 ms
Total runtime 44738 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-040A
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityCardinality

FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-2024-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716942067632

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type EXCL) for 0 ShieldIIPs-PT-040A-ReachabilityCardinality-2024-14
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 ShieldIIPs-PT-040A-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 ShieldIIPs-PT-040A-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 6 (type SRCH) for 0 ShieldIIPs-PT-040A-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 3 (type FNDP) for ShieldIIPs-PT-040A-ReachabilityCardinality-2024-14
lola: result : true
lola: fired transitions : 204
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 4 (type EQUN) for ShieldIIPs-PT-040A-ReachabilityCardinality-2024-14 (obsolete)
lola: CANCELED task # 6 (type SRCH) for ShieldIIPs-PT-040A-ReachabilityCardinality-2024-14 (obsolete)
lola: CANCELED task # 7 (type EXCL) for ShieldIIPs-PT-040A-ReachabilityCardinality-2024-14 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-040A-ReachabilityCardinality-2024-14: EF true findpath


Time elapsed: 0 secs. Pages in use: 2

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="gold2023"
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 gold2023"
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 r373-tall-171683788500084"
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 ;