About the Execution of 2023-gold for ShieldIIPs-PT-010B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
522.712 | 23743.00 | 35283.00 | 411.50 | TTFTFFTTTFTTTTTT | normal |
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-171683788400060.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-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788400060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.6K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 14:24 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 164K 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-010B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716934903375
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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-010B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-28 22:21:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 22:21:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:21:45] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-28 22:21:45] [INFO ] Transformed 603 places.
[2024-05-28 22:21:45] [INFO ] Transformed 593 transitions.
[2024-05-28 22:21:45] [INFO ] Found NUPN structural information;
[2024-05-28 22:21:45] [INFO ] Parsed PT model containing 603 places and 593 transitions and 1786 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 16) seen :10
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :1
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 593 rows 603 cols
[2024-05-28 22:21:46] [INFO ] Computed 91 invariants in 34 ms
[2024-05-28 22:21:47] [INFO ] After 729ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-28 22:21:47] [INFO ] [Nat]Absence check using 91 positive place invariants in 44 ms returned sat
[2024-05-28 22:21:48] [INFO ] After 683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-28 22:21:48] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 7 ms to minimize.
[2024-05-28 22:21:48] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2024-05-28 22:21:48] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-05-28 22:21:48] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-28 22:21:49] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 1 ms to minimize.
[2024-05-28 22:21:49] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2024-05-28 22:21:49] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-05-28 22:21:49] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2024-05-28 22:21:49] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2024-05-28 22:21:49] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
[2024-05-28 22:21:49] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-05-28 22:21:50] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 1 ms to minimize.
[2024-05-28 22:21:50] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2024-05-28 22:21:50] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 1 ms to minimize.
[2024-05-28 22:21:50] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2352 ms
[2024-05-28 22:21:50] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 1 ms to minimize.
[2024-05-28 22:21:50] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2024-05-28 22:21:51] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-28 22:21:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 390 ms
[2024-05-28 22:21:51] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2024-05-28 22:21:51] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2024-05-28 22:21:51] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 3 ms to minimize.
[2024-05-28 22:21:51] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-28 22:21:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 428 ms
[2024-05-28 22:21:51] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:21:51] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-28 22:21:51] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-28 22:21:52] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:21:52] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2024-05-28 22:21:52] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:21:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 540 ms
[2024-05-28 22:21:52] [INFO ] After 4648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 473 ms.
[2024-05-28 22:21:52] [INFO ] After 5415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 114 ms.
Support contains 47 out of 603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 603/603 places, 593/593 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 603 transition count 548
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 558 transition count 547
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 557 transition count 547
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 92 place count 557 transition count 502
Deduced a syphon composed of 45 places in 4 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 182 place count 512 transition count 502
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 243 place count 451 transition count 441
Iterating global reduction 3 with 61 rules applied. Total rules applied 304 place count 451 transition count 441
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 304 place count 451 transition count 419
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 348 place count 429 transition count 419
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 622 place count 292 transition count 282
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 680 place count 292 transition count 282
Applied a total of 680 rules in 126 ms. Remains 292 /603 variables (removed 311) and now considering 282/593 (removed 311) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 292/603 places, 282/593 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 5) seen :2
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :1
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 282 rows 292 cols
[2024-05-28 22:21:53] [INFO ] Computed 91 invariants in 8 ms
[2024-05-28 22:21:53] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 22:21:53] [INFO ] [Nat]Absence check using 88 positive place invariants in 12 ms returned sat
[2024-05-28 22:21:53] [INFO ] [Nat]Absence check using 88 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 22:21:53] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 22:21:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 22:21:53] [INFO ] After 146ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 22:21:53] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2024-05-28 22:21:53] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2024-05-28 22:21:53] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-28 22:21:53] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 4 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 685 ms
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 4 ms to minimize.
[2024-05-28 22:21:54] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-28 22:21:55] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-05-28 22:21:55] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-28 22:21:55] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 22:21:55] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 2 ms to minimize.
[2024-05-28 22:21:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 724 ms
[2024-05-28 22:21:55] [INFO ] After 1625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 118 ms.
[2024-05-28 22:21:55] [INFO ] After 2014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 34 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 282/282 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 292 transition count 280
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 280
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 282 transition count 272
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 282 transition count 272
Applied a total of 26 rules in 29 ms. Remains 282 /292 variables (removed 10) and now considering 272/282 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 282/292 places, 272/282 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 784394 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :{0=1}
Probabilistic random walk after 784394 steps, saw 141988 distinct states, run finished after 3002 ms. (steps per millisecond=261 ) properties seen :1
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 272 rows 282 cols
[2024-05-28 22:21:58] [INFO ] Computed 91 invariants in 9 ms
[2024-05-28 22:21:58] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:21:58] [INFO ] [Nat]Absence check using 89 positive place invariants in 15 ms returned sat
[2024-05-28 22:21:58] [INFO ] [Nat]Absence check using 89 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-28 22:21:58] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 22:21:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 22:21:59] [INFO ] After 105ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 22:21:59] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2024-05-28 22:21:59] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-28 22:21:59] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-28 22:21:59] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
[2024-05-28 22:21:59] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-28 22:21:59] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 22:21:59] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 22:21:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 424 ms
[2024-05-28 22:21:59] [INFO ] After 591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-28 22:21:59] [INFO ] After 922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 23 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 272/272 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 282 transition count 270
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 280 transition count 270
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 272 transition count 262
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 23 place count 272 transition count 262
Applied a total of 23 rules in 26 ms. Remains 272 /282 variables (removed 10) and now considering 262/272 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 272/282 places, 262/272 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 819981 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :{}
Probabilistic random walk after 819981 steps, saw 179148 distinct states, run finished after 3002 ms. (steps per millisecond=273 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 272 cols
[2024-05-28 22:22:02] [INFO ] Computed 91 invariants in 8 ms
[2024-05-28 22:22:02] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:22:02] [INFO ] [Nat]Absence check using 88 positive place invariants in 15 ms returned sat
[2024-05-28 22:22:02] [INFO ] [Nat]Absence check using 88 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-28 22:22:03] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 22:22:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 22:22:03] [INFO ] After 59ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 22:22:03] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2024-05-28 22:22:03] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-28 22:22:03] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-28 22:22:03] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-28 22:22:03] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2024-05-28 22:22:03] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2024-05-28 22:22:03] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-28 22:22:03] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 22:22:03] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 22:22:03] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-28 22:22:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 695 ms
[2024-05-28 22:22:03] [INFO ] After 812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-28 22:22:03] [INFO ] After 1152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 23 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 272/272 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-28 22:22:03] [INFO ] Invariant cache hit.
[2024-05-28 22:22:04] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-28 22:22:04] [INFO ] Invariant cache hit.
[2024-05-28 22:22:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 22:22:04] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-05-28 22:22:04] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-28 22:22:04] [INFO ] Invariant cache hit.
[2024-05-28 22:22:04] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 688 ms. Remains : 272/272 places, 262/262 transitions.
Graph (complete) has 1028 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 271 /272 variables (removed 1) and now considering 262/262 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 271 cols
[2024-05-28 22:22:04] [INFO ] Computed 90 invariants in 4 ms
[2024-05-28 22:22:04] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:22:04] [INFO ] [Nat]Absence check using 87 positive place invariants in 18 ms returned sat
[2024-05-28 22:22:04] [INFO ] [Nat]Absence check using 87 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 22:22:04] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 22:22:05] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2024-05-28 22:22:05] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-28 22:22:05] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2024-05-28 22:22:05] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-28 22:22:05] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-28 22:22:05] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:22:05] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2024-05-28 22:22:05] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-28 22:22:05] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-28 22:22:05] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
[2024-05-28 22:22:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 706 ms
[2024-05-28 22:22:05] [INFO ] After 919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-28 22:22:05] [INFO ] After 1085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-28 22:22:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-28 22:22:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 272 places, 262 transitions and 1253 arcs took 3 ms.
[2024-05-28 22:22:05] [INFO ] Flatten gal took : 59 ms
Total runtime 20496 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-010B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
ReachabilityFireability
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-2024-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1716934927118
--------------------
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 ReachabilityFireability -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/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/ReachabilityFireability.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-010B-ReachabilityFireability-2024-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 ShieldIIPs-PT-010B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 ShieldIIPs-PT-010B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 ShieldIIPs-PT-010B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type SRCH) for ShieldIIPs-PT-010B-ReachabilityFireability-2024-15
lola: result : true
lola: markings : 60
lola: fired transitions : 59
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for ShieldIIPs-PT-010B-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 4 (type EQUN) for ShieldIIPs-PT-010B-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 7 (type EXCL) for ShieldIIPs-PT-010B-ReachabilityFireability-2024-15 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-ReachabilityFireability-2024-15: EF true tandem / insertion
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-010B"
export BK_EXAMINATION="ReachabilityFireability"
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-010B, 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 r373-tall-171683788400060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-010B.tgz
mv ShieldIIPs-PT-010B 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 '
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 ;