Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r395-oct2-167903718900574.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldPPPt-PT-003B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718900574
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 21:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 21:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 21:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 56K Mar 5 18:23 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 ShieldPPPt-PT-003B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679573334332

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-003B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 12:08:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 12:08:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:08:57] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-23 12:08:57] [INFO ] Transformed 237 places.
[2023-03-23 12:08:57] [INFO ] Transformed 216 transitions.
[2023-03-23 12:08:57] [INFO ] Found NUPN structural information;
[2023-03-23 12:08:57] [INFO ] Parsed PT model containing 237 places and 216 transitions and 540 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 14) seen :10
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :1
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :1
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 216 rows 237 cols
[2023-03-23 12:08:58] [INFO ] Computed 34 place invariants in 14 ms
[2023-03-23 12:08:58] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-23 12:08:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 23 ms returned sat
[2023-03-23 12:08:59] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-23 12:08:59] [INFO ] Deduced a trap composed of 16 places in 358 ms of which 23 ms to minimize.
[2023-03-23 12:08:59] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2023-03-23 12:08:59] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 1 ms to minimize.
[2023-03-23 12:09:00] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 2 ms to minimize.
[2023-03-23 12:09:00] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 1 ms to minimize.
[2023-03-23 12:09:00] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 0 ms to minimize.
[2023-03-23 12:09:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1323 ms
[2023-03-23 12:09:00] [INFO ] After 1602ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-23 12:09:00] [INFO ] After 1811ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 23 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 216/216 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 237 transition count 167
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 100 place count 188 transition count 165
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 105 place count 187 transition count 161
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 109 place count 183 transition count 161
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 109 place count 183 transition count 149
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 133 place count 171 transition count 149
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 151 place count 153 transition count 131
Iterating global reduction 4 with 18 rules applied. Total rules applied 169 place count 153 transition count 131
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 169 place count 153 transition count 122
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 187 place count 144 transition count 122
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 253 place count 111 transition count 89
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 267 place count 104 transition count 89
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 271 place count 104 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 272 place count 103 transition count 88
Applied a total of 272 rules in 81 ms. Remains 103 /237 variables (removed 134) and now considering 88/216 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 103/237 places, 88/216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1152417 steps, run timeout after 3001 ms. (steps per millisecond=384 ) properties seen :{}
Probabilistic random walk after 1152417 steps, saw 853346 distinct states, run finished after 3004 ms. (steps per millisecond=383 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 103 cols
[2023-03-23 12:09:03] [INFO ] Computed 34 place invariants in 17 ms
[2023-03-23 12:09:03] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:09:04] [INFO ] [Nat]Absence check using 34 positive place invariants in 22 ms returned sat
[2023-03-23 12:09:04] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:09:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-23 12:09:04] [INFO ] After 22ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:09:04] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 21 ms to minimize.
[2023-03-23 12:09:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-23 12:09:04] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-23 12:09:04] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 103/103 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 88/88 transitions.
Applied a total of 0 rules in 16 ms. Remains 103 /103 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-23 12:09:04] [INFO ] Invariant cache hit.
[2023-03-23 12:09:04] [INFO ] Implicit Places using invariants in 140 ms returned [95]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 102/103 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 163 ms. Remains : 102/103 places, 88/88 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1385417 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :{}
Probabilistic random walk after 1385417 steps, saw 1015962 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 102 cols
[2023-03-23 12:09:07] [INFO ] Computed 33 place invariants in 4 ms
[2023-03-23 12:09:07] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:09:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-23 12:09:07] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:09:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-23 12:09:07] [INFO ] After 62ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:09:08] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-03-23 12:09:08] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2023-03-23 12:09:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-03-23 12:09:08] [INFO ] After 293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-23 12:09:08] [INFO ] After 538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 23 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 88/88 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 102/102 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-23 12:09:08] [INFO ] Invariant cache hit.
[2023-03-23 12:09:08] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-23 12:09:08] [INFO ] Invariant cache hit.
[2023-03-23 12:09:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-23 12:09:08] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2023-03-23 12:09:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 12:09:08] [INFO ] Invariant cache hit.
[2023-03-23 12:09:09] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 797 ms. Remains : 102/102 places, 88/88 transitions.
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 102 transition count 88
Applied a total of 12 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 102 cols
[2023-03-23 12:09:09] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-23 12:09:09] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:09:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2023-03-23 12:09:09] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:09:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-23 12:09:09] [INFO ] After 35ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:09:09] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2023-03-23 12:09:09] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2023-03-23 12:09:09] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2023-03-23 12:09:09] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2023-03-23 12:09:09] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2023-03-23 12:09:10] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 1 ms to minimize.
[2023-03-23 12:09:10] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2023-03-23 12:09:10] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2023-03-23 12:09:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 926 ms
[2023-03-23 12:09:10] [INFO ] After 994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-23 12:09:10] [INFO ] After 1175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:09:10] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 11 ms.
[2023-03-23 12:09:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 88 transitions and 316 arcs took 2 ms.
[2023-03-23 12:09:10] [INFO ] Flatten gal took : 77 ms
Total runtime 13276 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 003B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 102 places, 88 transitions, 316 arcs.
Final Score: 906.158
Took : 2 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldPPPt-PT-003B-ReachabilityCardinality-13 (reachable &!potential( ( ( ( ( (tk(P75)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P75)) ) ) | ( ( (tk(P41)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P41)) ) ) ) | ( ( ( ( (tk(P8)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P8)) ) ) & ( ( (tk(P85)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P85)) ) ) ) | ( ( ( ( ( ( (tk(P85)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P85)) ) ) | ( ( (tk(P6)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P6)) ) ) ) & ( ( ( ( (tk(P8)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P8)) ) ) | ( ( (tk(P39)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P39)) ) ) ) | ( ( ( (tk(P52)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P52)) ) ) | ( ( ( (tk(P82)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P82)) ) ) | ( ( (tk(P4)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P4)) ) ) ) ) ) ) & ( ( ( ( (tk(P20)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P20)) ) ) | ( ( ( (tk(P88)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P88)) ) ) & ( ( (tk(P14)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P14)) ) ) ) ) & ( ( ( ( ( (tk(P71)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P71)) ) ) | ( ( (tk(P43)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P43)) ) ) ) | ( ( ( (tk(P80)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P80)) ) ) | ( ( ( (tk(P66)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P66)) ) ) & ( ( (tk(P4)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P4)) ) ) ) ) ) & ( ( ( (tk(P91)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P91)) ) ) | ( ( ( (tk(P12)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P12)) ) ) | ( ( (tk(P96)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P96)) ) ) ) ) ) ) ) | ( ( ( ( (tk(P3)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P3)) ) ) & ( ( (tk(P66)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P66)) ) ) ) & ( ( ( (tk(P88)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P88)) ) ) & ( ( ( (tk(P54)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P54)) ) ) & ( ( ( (tk(P32)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P32)) ) ) | ( ( (tk(P37)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P37)) ) ) ) ) ) ) ) ) )))
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679573354325

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="ShieldPPPt-PT-003B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is ShieldPPPt-PT-003B, 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 r395-oct2-167903718900574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-003B.tgz
mv ShieldPPPt-PT-003B 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 ;