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-167903718600310.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 ShieldIIPt-PT-040A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718600310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 17:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:24 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.4K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 17:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 17:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 212K 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 ShieldIIPt-PT-040A-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-040A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679561331198

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=ShieldIIPt-PT-040A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 08:48:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 08:48:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:48:55] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2023-03-23 08:48:55] [INFO ] Transformed 763 places.
[2023-03-23 08:48:55] [INFO ] Transformed 563 transitions.
[2023-03-23 08:48:55] [INFO ] Found NUPN structural information;
[2023-03-23 08:48:55] [INFO ] Parsed PT model containing 763 places and 563 transitions and 2406 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 12) seen :4
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 562 rows 763 cols
[2023-03-23 08:48:57] [INFO ] Computed 361 place invariants in 29 ms
[2023-03-23 08:48:58] [INFO ] After 960ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 08:48:58] [INFO ] [Nat]Absence check using 361 positive place invariants in 73 ms returned sat
[2023-03-23 08:49:00] [INFO ] After 1422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 08:49:01] [INFO ] After 2918ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1405 ms.
[2023-03-23 08:49:03] [INFO ] After 4918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 922 ms.
Support contains 86 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Partial Free-agglomeration rule applied 57 times.
Drop transitions removed 57 transitions
Iterating global reduction 0 with 57 rules applied. Total rules applied 59 place count 762 transition count 561
Applied a total of 59 rules in 170 ms. Remains 762 /763 variables (removed 1) and now considering 561/562 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 762/763 places, 561/562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 79067 steps, run timeout after 3003 ms. (steps per millisecond=26 ) properties seen :{2=1, 3=1, 4=1, 7=1}
Probabilistic random walk after 79067 steps, saw 77721 distinct states, run finished after 3005 ms. (steps per millisecond=26 ) properties seen :4
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 561 rows 762 cols
[2023-03-23 08:49:08] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-23 08:49:08] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 08:49:09] [INFO ] [Nat]Absence check using 361 positive place invariants in 356 ms returned sat
[2023-03-23 08:49:09] [INFO ] After 623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 08:49:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-23 08:49:10] [INFO ] After 447ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 08:49:10] [INFO ] After 939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 480 ms.
[2023-03-23 08:49:11] [INFO ] After 2663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 319 ms.
Support contains 54 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 561/561 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 762 transition count 561
Applied a total of 9 rules in 54 ms. Remains 762 /762 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 762/762 places, 561/561 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 77077 steps, run timeout after 3005 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77077 steps, saw 75705 distinct states, run finished after 3009 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 561 rows 762 cols
[2023-03-23 08:49:15] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-23 08:49:15] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 08:49:16] [INFO ] [Nat]Absence check using 361 positive place invariants in 174 ms returned sat
[2023-03-23 08:49:17] [INFO ] After 1224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 08:49:17] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-23 08:49:17] [INFO ] After 618ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 08:49:18] [INFO ] After 1155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 308 ms.
[2023-03-23 08:49:18] [INFO ] After 3198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 319 ms.
Support contains 54 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 561/561 transitions.
Applied a total of 0 rules in 32 ms. Remains 762 /762 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 762/762 places, 561/561 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 561/561 transitions.
Applied a total of 0 rules in 32 ms. Remains 762 /762 variables (removed 0) and now considering 561/561 (removed 0) transitions.
[2023-03-23 08:49:19] [INFO ] Invariant cache hit.
[2023-03-23 08:49:19] [INFO ] Implicit Places using invariants in 703 ms returned [753]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 711 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 761/762 places, 561/561 transitions.
Applied a total of 0 rules in 20 ms. Remains 761 /761 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 764 ms. Remains : 761/762 places, 561/561 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 92744 steps, run timeout after 3002 ms. (steps per millisecond=30 ) properties seen :{3=1}
Probabilistic random walk after 92744 steps, saw 91124 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :1
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 561 rows 761 cols
[2023-03-23 08:49:23] [INFO ] Computed 360 place invariants in 4 ms
[2023-03-23 08:49:24] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:49:24] [INFO ] [Nat]Absence check using 360 positive place invariants in 460 ms returned sat
[2023-03-23 08:49:25] [INFO ] After 679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:49:25] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-23 08:49:25] [INFO ] After 347ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:49:26] [INFO ] After 905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 351 ms.
[2023-03-23 08:49:26] [INFO ] After 2789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 183 ms.
Support contains 43 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 561/561 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 761 transition count 561
Applied a total of 5 rules in 36 ms. Remains 761 /761 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 761/761 places, 561/561 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 109541 steps, run timeout after 3015 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109541 steps, saw 107075 distinct states, run finished after 3015 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 561 rows 761 cols
[2023-03-23 08:49:30] [INFO ] Computed 360 place invariants in 8 ms
[2023-03-23 08:49:30] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:49:31] [INFO ] [Nat]Absence check using 360 positive place invariants in 62 ms returned sat
[2023-03-23 08:49:31] [INFO ] After 700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:49:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-23 08:49:32] [INFO ] After 291ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:49:32] [INFO ] After 743ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 370 ms.
[2023-03-23 08:49:32] [INFO ] After 2105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 175 ms.
Support contains 43 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 561/561 transitions.
Applied a total of 0 rules in 17 ms. Remains 761 /761 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 761/761 places, 561/561 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 561/561 transitions.
Applied a total of 0 rules in 16 ms. Remains 761 /761 variables (removed 0) and now considering 561/561 (removed 0) transitions.
[2023-03-23 08:49:33] [INFO ] Invariant cache hit.
[2023-03-23 08:49:34] [INFO ] Implicit Places using invariants in 1487 ms returned []
[2023-03-23 08:49:34] [INFO ] Invariant cache hit.
[2023-03-23 08:49:35] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-23 08:49:36] [INFO ] Implicit Places using invariants and state equation in 2231 ms returned []
Implicit Place search using SMT with State Equation took 3761 ms to find 0 implicit places.
[2023-03-23 08:49:37] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-23 08:49:37] [INFO ] Invariant cache hit.
[2023-03-23 08:49:37] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4601 ms. Remains : 761/761 places, 561/561 transitions.
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 761 transition count 561
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 761 transition count 527
Applied a total of 68 rules in 147 ms. Remains 761 /761 variables (removed 0) and now considering 527/561 (removed 34) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 527 rows 761 cols
[2023-03-23 08:49:37] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-23 08:49:38] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:49:38] [INFO ] [Nat]Absence check using 360 positive place invariants in 55 ms returned sat
[2023-03-23 08:49:39] [INFO ] After 983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:49:39] [INFO ] After 1323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 393 ms.
[2023-03-23 08:49:40] [INFO ] After 2080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:49:40] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-23 08:49:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 761 places, 561 transitions and 2576 arcs took 3 ms.
[2023-03-23 08:49:40] [INFO ] Flatten gal took : 160 ms
Total runtime 45564 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (PT), instance 040A
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: 761 places, 561 transitions, 2576 arcs.
Final Score: 68401.844
Took : 27 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPt-PT-040A-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( ( (tk(P543)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P543)) ) ) | ( ( (tk(P134)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P134)) ) ) ) | ( ( ( (tk(P95)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P95)) ) ) | ( ( ( (tk(P68)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P68)) ) ) | ( ( ( ( (tk(P363)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P363)) ) ) & ( ( (tk(P411)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P411)) ) ) ) & ( ( ( (tk(P49)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P49)) ) ) & ( ( ( (tk(P432)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P432)) ) ) & ( ( ( (tk(P211)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P211)) ) ) | ( ( (tk(P91)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P91)) ) ) ) ) ) ) ) ) ) | ( ( ( ( ( (tk(P215)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P215)) ) ) & ( ( (tk(P483)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P483)) ) ) ) | ( ( ( (tk(P224)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P224)) ) ) & ( ( (tk(P13)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P13)) ) ) ) ) | ( ( ( ( (tk(P577)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P577)) ) ) & ( ( ( (tk(P100)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P100)) ) ) & ( ( (tk(P135)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P135)) ) ) ) ) | ( ( ( ( ( (tk(P136)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P136)) ) ) | ( ( (tk(P363)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P363)) ) ) ) & ( ( ( (tk(P645)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P645)) ) ) | ( ( (tk(P28)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P28)) ) ) ) ) | ( ( ( (tk(P178)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P178)) ) ) & ( ( ( (tk(P671)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P671)) ) ) | ( ( (tk(P503)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P503)) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-040A-ReachabilityCardinality-02 (reachable &!potential( ( ( ( (tk(P338)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P338)) ) ) | ( ( (tk(P700)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P700)) ) ) )))
PROPERTY: ShieldIIPt-PT-040A-ReachabilityCardinality-10 (reachable & potential(( ( ( ( (tk(P635)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P635)) ) ) & ( ( (tk(P330)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P330)) ) ) ) & ( ( ( (tk(P631)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P631)) ) ) & ( ( ( (tk(P334)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P334)) ) ) & ( ( ( ( (tk(P754)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P754)) ) ) | ( ( ( (tk(P477)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P477)) ) ) | ( ( (tk(P74)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P74)) ) ) ) ) | ( ( ( (tk(P501)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P501)) ) ) | ( ( ( ( ( (tk(P231)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P231)) ) ) & ( ( ( (tk(P173)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P173)) ) ) & ( ( (tk(P144)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P144)) ) ) ) ) & ( ( ( (tk(P405)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P405)) ) ) & ( ( ( (tk(P511)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P511)) ) ) & ( ( (tk(P95)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P95)) ) ) ) ) ) | ( ( ( ( (tk(P5)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P5)) ) ) & ( ( (tk(P455)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P455)) ) ) ) & ( ( ( (tk(P203)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P203)) ) ) & ( ( ( (tk(P35)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P35)) ) ) & ( ( (tk(P666)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P666)) ) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 9290280 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16103352 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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
Caught signal 15, terminating.

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="ShieldIIPt-PT-040A"
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 ShieldIIPt-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 r395-oct2-167903718600310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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