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.r394-oct2-167903717700310.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 marciexred
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 r394-oct2-167903717700310
=====================================================================

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

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:41:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 16:41:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:41:57] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-22 16:41:57] [INFO ] Transformed 763 places.
[2023-03-22 16:41:57] [INFO ] Transformed 563 transitions.
[2023-03-22 16:41:57] [INFO ] Found NUPN structural information;
[2023-03-22 16:41:57] [INFO ] Parsed PT model containing 763 places and 563 transitions and 2406 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 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 497 ms. (steps per millisecond=20 ) properties (out of 12) seen :1
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 87039 steps, run timeout after 3003 ms. (steps per millisecond=28 ) properties seen :{3=1, 4=1, 5=1, 6=1, 9=1, 10=1}
Probabilistic random walk after 87039 steps, saw 85858 distinct states, run finished after 3006 ms. (steps per millisecond=28 ) properties seen :6
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 562 rows 763 cols
[2023-03-22 16:42:01] [INFO ] Computed 361 place invariants in 20 ms
[2023-03-22 16:42:02] [INFO ] After 561ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 16:42:02] [INFO ] [Nat]Absence check using 361 positive place invariants in 155 ms returned sat
[2023-03-22 16:42:04] [INFO ] After 1477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 16:42:05] [INFO ] After 2214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 725 ms.
[2023-03-22 16:42:05] [INFO ] After 3440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 456 ms.
Support contains 76 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 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 63 place count 762 transition count 561
Applied a total of 63 rules in 141 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 142 ms. Remains : 762/763 places, 561/562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 99039 steps, run timeout after 3003 ms. (steps per millisecond=32 ) properties seen :{2=1}
Probabilistic random walk after 99039 steps, saw 97138 distinct states, run finished after 3003 ms. (steps per millisecond=32 ) properties seen :1
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-22 16:42:10] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-22 16:42:10] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 16:42:10] [INFO ] [Nat]Absence check using 361 positive place invariants in 74 ms returned sat
[2023-03-22 16:42:11] [INFO ] After 901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 16:42:11] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-22 16:42:12] [INFO ] After 499ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 16:42:13] [INFO ] After 1130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 631 ms.
[2023-03-22 16:42:13] [INFO ] After 3145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 331 ms.
Support contains 50 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 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 762 transition count 561
Applied a total of 8 rules in 87 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 87 ms. Remains : 762/762 places, 561/561 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 97717 steps, run timeout after 3004 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97717 steps, saw 95809 distinct states, run finished after 3006 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 561 rows 762 cols
[2023-03-22 16:42:17] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-22 16:42:18] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 16:42:18] [INFO ] [Nat]Absence check using 361 positive place invariants in 68 ms returned sat
[2023-03-22 16:42:19] [INFO ] After 649ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 16:42:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 16:42:19] [INFO ] After 508ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 16:42:20] [INFO ] After 1252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 629 ms.
[2023-03-22 16:42:20] [INFO ] After 2892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 423 ms.
Support contains 50 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 22 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 22 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 27 ms. Remains 762 /762 variables (removed 0) and now considering 561/561 (removed 0) transitions.
[2023-03-22 16:42:21] [INFO ] Invariant cache hit.
[2023-03-22 16:42:21] [INFO ] Implicit Places using invariants in 539 ms returned [753]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 545 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 17 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 590 ms. Remains : 761/762 places, 561/561 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-040A-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 561 rows 761 cols
[2023-03-22 16:42:22] [INFO ] Computed 360 place invariants in 7 ms
[2023-03-22 16:42:22] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 16:42:22] [INFO ] [Nat]Absence check using 360 positive place invariants in 74 ms returned sat
[2023-03-22 16:42:23] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 16:42:23] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-22 16:42:23] [INFO ] After 311ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 16:42:24] [INFO ] After 716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 239 ms.
[2023-03-22 16:42:24] [INFO ] After 1886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 148 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 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 761 transition count 561
Applied a total of 2 rules in 34 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 34 ms. Remains : 761/761 places, 561/561 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 137333 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137333 steps, saw 134438 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 561 rows 761 cols
[2023-03-22 16:42:28] [INFO ] Computed 360 place invariants in 22 ms
[2023-03-22 16:42:28] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 16:42:28] [INFO ] [Nat]Absence check using 360 positive place invariants in 72 ms returned sat
[2023-03-22 16:42:29] [INFO ] After 655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 16:42:29] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 16:42:30] [INFO ] After 910ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 16:42:30] [INFO ] After 1195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 386 ms.
[2023-03-22 16:42:30] [INFO ] After 2586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 165 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-22 16:42:31] [INFO ] Invariant cache hit.
[2023-03-22 16:42:31] [INFO ] Implicit Places using invariants in 670 ms returned []
[2023-03-22 16:42:31] [INFO ] Invariant cache hit.
[2023-03-22 16:42:32] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 16:42:33] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 2273 ms to find 0 implicit places.
[2023-03-22 16:42:33] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-22 16:42:33] [INFO ] Invariant cache hit.
[2023-03-22 16:42:33] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2778 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 51 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-22 16:42:33] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-22 16:42:34] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 16:42:34] [INFO ] [Nat]Absence check using 360 positive place invariants in 69 ms returned sat
[2023-03-22 16:42:34] [INFO ] After 597ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 16:42:35] [INFO ] After 908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 428 ms.
[2023-03-22 16:42:35] [INFO ] After 1682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 16:42:35] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-22 16:42:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 761 places, 561 transitions and 2576 arcs took 7 ms.
[2023-03-22 16:42:36] [INFO ] Flatten gal took : 125 ms
Total runtime 39138 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldIIPt_PT_040A
(NrP: 761 NrTr: 561 NrArc: 2576)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.050sec

net check time: 0m 0.000sec

init dd package: 0m 2.987sec


before gc: list nodes free: 796603

after gc: idd nodes used:110947, unused:63889053; list nodes free:290977668

before gc: list nodes free: 1080866

after gc: idd nodes used:364353, unused:63635647; list nodes free:291882666

before gc: list nodes free: 31797

after gc: idd nodes used:391391, unused:63608609; list nodes free:291761911

before gc: list nodes free: 1177841

after gc: idd nodes used:3088546, unused:60911454; list nodes free:285318055

before gc: list nodes free: 961000

after gc: idd nodes used:3168132, unused:60831868; list nodes free:287161203

before gc: list nodes free: 4008497

after gc: idd nodes used:1287140, unused:62712860; list nodes free:295973392

before gc: list nodes free: 687471

after gc: idd nodes used:4459906, unused:59540094; list nodes free:281123039
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5995176 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095824 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

64372 90755 355091 343217 651318 3566132

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="marciexred"
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 marciexred"
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 r394-oct2-167903717700310"
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 ;