fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r394-oct2-167903717800322
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldIIPt-PT-050A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10050.363 3600000.00 3700628.00 172.70 ?????TT????????T normal

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-167903717800322.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-050A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717800322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.5K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:39 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.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 18:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 25 18:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 18:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:35 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 265K 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-050A-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679504731082

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 17:05:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 17:05:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:05:33] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-22 17:05:33] [INFO ] Transformed 953 places.
[2023-03-22 17:05:33] [INFO ] Transformed 703 transitions.
[2023-03-22 17:05:33] [INFO ] Found NUPN structural information;
[2023-03-22 17:05:33] [INFO ] Parsed PT model containing 953 places and 703 transitions and 3006 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-050A-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 183 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 67 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2023-03-22 17:05:33] [INFO ] Computed 451 place invariants in 13 ms
[2023-03-22 17:05:34] [INFO ] Implicit Places using invariants in 1104 ms returned []
[2023-03-22 17:05:34] [INFO ] Invariant cache hit.
[2023-03-22 17:05:36] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned []
Implicit Place search using SMT with State Equation took 2614 ms to find 0 implicit places.
[2023-03-22 17:05:36] [INFO ] Invariant cache hit.
[2023-03-22 17:05:36] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3307 ms. Remains : 953/953 places, 702/702 transitions.
Support contains 183 out of 953 places after structural reductions.
[2023-03-22 17:05:37] [INFO ] Flatten gal took : 159 ms
[2023-03-22 17:05:37] [INFO ] Flatten gal took : 62 ms
[2023-03-22 17:05:37] [INFO ] Input system was already deterministic with 702 transitions.
Support contains 179 out of 953 places (down from 183) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 83) seen :19
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 64) seen :0
Running SMT prover for 64 properties.
[2023-03-22 17:05:38] [INFO ] Invariant cache hit.
[2023-03-22 17:05:41] [INFO ] [Real]Absence check using 451 positive place invariants in 187 ms returned sat
[2023-03-22 17:05:41] [INFO ] After 3181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:64
[2023-03-22 17:05:43] [INFO ] [Nat]Absence check using 451 positive place invariants in 137 ms returned sat
[2023-03-22 17:05:52] [INFO ] After 7359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :64
[2023-03-22 17:06:02] [INFO ] After 16817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :64
Attempting to minimize the solution found.
Minimization took 4534 ms.
[2023-03-22 17:06:06] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :63
Parikh walk visited 43 properties in 11649 ms.
Support contains 63 out of 953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 951 transition count 700
Partial Free-agglomeration rule applied 84 times.
Drop transitions removed 84 transitions
Iterating global reduction 0 with 84 rules applied. Total rules applied 88 place count 951 transition count 700
Applied a total of 88 rules in 157 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 951/953 places, 700/702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 76495 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{0=1, 2=1, 3=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 13=1, 14=1, 15=1, 17=1, 19=1, 20=1}
Probabilistic random walk after 76495 steps, saw 74992 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :16
Running SMT prover for 5 properties.
// Phase 1: matrix 700 rows 951 cols
[2023-03-22 17:06:22] [INFO ] Computed 451 place invariants in 4 ms
[2023-03-22 17:06:23] [INFO ] [Real]Absence check using 451 positive place invariants in 116 ms returned sat
[2023-03-22 17:06:23] [INFO ] After 1123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 17:06:24] [INFO ] [Nat]Absence check using 451 positive place invariants in 116 ms returned sat
[2023-03-22 17:06:24] [INFO ] After 775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 17:06:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 17:06:25] [INFO ] After 524ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 17:06:26] [INFO ] After 1151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 446 ms.
[2023-03-22 17:06:26] [INFO ] After 2970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 813 ms.
Support contains 25 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 700/700 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 951 transition count 700
Applied a total of 9 rules in 80 ms. Remains 951 /951 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 951/951 places, 700/700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 96595 steps, run timeout after 3003 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96595 steps, saw 94496 distinct states, run finished after 3005 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 700 rows 951 cols
[2023-03-22 17:06:31] [INFO ] Computed 451 place invariants in 9 ms
[2023-03-22 17:06:31] [INFO ] [Real]Absence check using 451 positive place invariants in 96 ms returned sat
[2023-03-22 17:06:32] [INFO ] After 1119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 17:06:32] [INFO ] [Nat]Absence check using 451 positive place invariants in 141 ms returned sat
[2023-03-22 17:06:33] [INFO ] After 771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 17:06:33] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 17:06:34] [INFO ] After 589ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 17:06:34] [INFO ] After 1103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 406 ms.
[2023-03-22 17:06:35] [INFO ] After 2871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 711 ms.
Support contains 25 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 700/700 transitions.
Applied a total of 0 rules in 23 ms. Remains 951 /951 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 951/951 places, 700/700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 700/700 transitions.
Applied a total of 0 rules in 23 ms. Remains 951 /951 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-22 17:06:35] [INFO ] Invariant cache hit.
[2023-03-22 17:06:36] [INFO ] Implicit Places using invariants in 536 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 549 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 949/951 places, 700/700 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 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 25 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-22 17:06:36] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-22 17:06:37] [INFO ] Implicit Places using invariants in 744 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 746 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 947/951 places, 699/700 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 946 transition count 698
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 79 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-22 17:06:37] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-22 17:06:37] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-22 17:06:37] [INFO ] Invariant cache hit.
[2023-03-22 17:06:38] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-22 17:06:39] [INFO ] Implicit Places using invariants and state equation in 1709 ms returned []
Implicit Place search using SMT with State Equation took 2276 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 946/951 places, 698/700 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3698 ms. Remains : 946/951 places, 698/700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 96168 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96168 steps, saw 94084 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-22 17:06:43] [INFO ] Invariant cache hit.
[2023-03-22 17:06:43] [INFO ] [Real]Absence check using 448 positive place invariants in 103 ms returned sat
[2023-03-22 17:06:44] [INFO ] After 847ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 17:06:44] [INFO ] [Nat]Absence check using 448 positive place invariants in 112 ms returned sat
[2023-03-22 17:06:45] [INFO ] After 782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 17:06:45] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-22 17:06:46] [INFO ] After 1051ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 17:06:47] [INFO ] After 1905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 733 ms.
[2023-03-22 17:06:48] [INFO ] After 3948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 655 ms.
Support contains 25 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 28 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 946/946 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 29 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-22 17:06:48] [INFO ] Invariant cache hit.
[2023-03-22 17:06:49] [INFO ] Implicit Places using invariants in 452 ms returned []
[2023-03-22 17:06:49] [INFO ] Invariant cache hit.
[2023-03-22 17:06:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-22 17:06:50] [INFO ] Implicit Places using invariants and state equation in 1619 ms returned []
Implicit Place search using SMT with State Equation took 2073 ms to find 0 implicit places.
[2023-03-22 17:06:50] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-22 17:06:50] [INFO ] Invariant cache hit.
[2023-03-22 17:06:51] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2733 ms. Remains : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 44 times.
Drop transitions removed 44 transitions
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 946 transition count 698
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 946 transition count 654
Applied a total of 88 rules in 90 ms. Remains 946 /946 variables (removed 0) and now considering 654/698 (removed 44) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 654 rows 946 cols
[2023-03-22 17:06:51] [INFO ] Computed 448 place invariants in 7 ms
[2023-03-22 17:06:51] [INFO ] [Real]Absence check using 448 positive place invariants in 76 ms returned sat
[2023-03-22 17:06:52] [INFO ] After 854ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 17:06:52] [INFO ] [Nat]Absence check using 448 positive place invariants in 113 ms returned sat
[2023-03-22 17:06:53] [INFO ] After 795ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 17:06:54] [INFO ] After 1564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 709 ms.
[2023-03-22 17:06:55] [INFO ] After 2827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-22 17:06:55] [INFO ] Flatten gal took : 68 ms
[2023-03-22 17:06:55] [INFO ] Flatten gal took : 45 ms
[2023-03-22 17:06:55] [INFO ] Input system was already deterministic with 702 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 17 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 953/953 places, 702/702 transitions.
[2023-03-22 17:06:55] [INFO ] Flatten gal took : 41 ms
[2023-03-22 17:06:55] [INFO ] Flatten gal took : 42 ms
[2023-03-22 17:06:55] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 16 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 953/953 places, 702/702 transitions.
[2023-03-22 17:06:55] [INFO ] Flatten gal took : 38 ms
[2023-03-22 17:06:55] [INFO ] Flatten gal took : 37 ms
[2023-03-22 17:06:55] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 15 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 953/953 places, 702/702 transitions.
[2023-03-22 17:06:55] [INFO ] Flatten gal took : 36 ms
[2023-03-22 17:06:55] [INFO ] Flatten gal took : 38 ms
[2023-03-22 17:06:56] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 14 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 953/953 places, 702/702 transitions.
[2023-03-22 17:06:56] [INFO ] Flatten gal took : 36 ms
[2023-03-22 17:06:56] [INFO ] Flatten gal took : 37 ms
[2023-03-22 17:06:56] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 15 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 953/953 places, 702/702 transitions.
[2023-03-22 17:06:56] [INFO ] Flatten gal took : 36 ms
[2023-03-22 17:06:56] [INFO ] Flatten gal took : 37 ms
[2023-03-22 17:06:56] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 56 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 951/953 places, 700/702 transitions.
[2023-03-22 17:06:56] [INFO ] Flatten gal took : 36 ms
[2023-03-22 17:06:56] [INFO ] Flatten gal took : 37 ms
[2023-03-22 17:06:56] [INFO ] Input system was already deterministic with 700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 2814 steps, run visited all 1 properties in 36 ms. (steps per millisecond=78 )
Probabilistic random walk after 2814 steps, saw 2670 distinct states, run finished after 37 ms. (steps per millisecond=76 ) properties seen :1
FORMULA ShieldIIPt-PT-050A-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 62 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 951/953 places, 700/702 transitions.
[2023-03-22 17:06:56] [INFO ] Flatten gal took : 48 ms
[2023-03-22 17:06:56] [INFO ] Flatten gal took : 38 ms
[2023-03-22 17:06:56] [INFO ] Input system was already deterministic with 700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 2437 steps, run visited all 1 properties in 31 ms. (steps per millisecond=78 )
Probabilistic random walk after 2437 steps, saw 2304 distinct states, run finished after 32 ms. (steps per millisecond=76 ) properties seen :1
FORMULA ShieldIIPt-PT-050A-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 27 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 953/953 places, 702/702 transitions.
[2023-03-22 17:06:57] [INFO ] Flatten gal took : 41 ms
[2023-03-22 17:06:57] [INFO ] Flatten gal took : 37 ms
[2023-03-22 17:06:57] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 47 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 951/953 places, 700/702 transitions.
[2023-03-22 17:06:57] [INFO ] Flatten gal took : 36 ms
[2023-03-22 17:06:57] [INFO ] Flatten gal took : 37 ms
[2023-03-22 17:06:57] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 44 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 951/953 places, 700/702 transitions.
[2023-03-22 17:06:57] [INFO ] Flatten gal took : 36 ms
[2023-03-22 17:06:57] [INFO ] Flatten gal took : 38 ms
[2023-03-22 17:06:57] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 51 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 951/953 places, 700/702 transitions.
[2023-03-22 17:06:57] [INFO ] Flatten gal took : 35 ms
[2023-03-22 17:06:57] [INFO ] Flatten gal took : 37 ms
[2023-03-22 17:06:57] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 15 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 953/953 places, 702/702 transitions.
[2023-03-22 17:06:57] [INFO ] Flatten gal took : 36 ms
[2023-03-22 17:06:57] [INFO ] Flatten gal took : 37 ms
[2023-03-22 17:06:58] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 43 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 951/953 places, 700/702 transitions.
[2023-03-22 17:06:58] [INFO ] Flatten gal took : 36 ms
[2023-03-22 17:06:58] [INFO ] Flatten gal took : 37 ms
[2023-03-22 17:06:58] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 16 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 953/953 places, 702/702 transitions.
[2023-03-22 17:06:58] [INFO ] Flatten gal took : 35 ms
[2023-03-22 17:06:58] [INFO ] Flatten gal took : 45 ms
[2023-03-22 17:06:58] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 15 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 953/953 places, 702/702 transitions.
[2023-03-22 17:06:58] [INFO ] Flatten gal took : 34 ms
[2023-03-22 17:06:58] [INFO ] Flatten gal took : 35 ms
[2023-03-22 17:06:58] [INFO ] Input system was already deterministic with 702 transitions.
[2023-03-22 17:06:58] [INFO ] Flatten gal took : 37 ms
[2023-03-22 17:06:58] [INFO ] Flatten gal took : 37 ms
[2023-03-22 17:06:58] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-22 17:06:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 953 places, 702 transitions and 3004 arcs took 5 ms.
Total runtime 85399 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 953 NrTr: 702 NrArc: 3004)

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

net check time: 0m 0.000sec

init dd package: 0m 2.899sec


before gc: list nodes free: 2011854

after gc: idd nodes used:2340, unused:63997660; list nodes free:285197047

before gc: list nodes free: 1727204

after gc: idd nodes used:2288, unused:63997712; list nodes free:285197221

before gc: list nodes free: 1660436

after gc: idd nodes used:2367, unused:63997633; list nodes free:285196680

before gc: list nodes free: 1452577

after gc: idd nodes used:2403, unused:63997597; list nodes free:285196617

before gc: list nodes free: 1220451

after gc: idd nodes used:2523, unused:63997477; list nodes free:285195835

before gc: list nodes free: 1356743

after gc: idd nodes used:2382, unused:63997618; list nodes free:285196388

before gc: list nodes free: 1197310

after gc: idd nodes used:2484, unused:63997516; list nodes free:285196017

before gc: list nodes free: 966162

after gc: idd nodes used:2608, unused:63997392; list nodes free:285195278

before gc: list nodes free: 742543

after gc: idd nodes used:2678, unused:63997322; list nodes free:285194808

before gc: list nodes free: 997219

after gc: idd nodes used:2460, unused:63997540; list nodes free:285195935

before gc: list nodes free: 879227

after gc: idd nodes used:2508, unused:63997492; list nodes free:285195759

before gc: list nodes free: 529932

after gc: idd nodes used:2708, unused:63997292; list nodes free:285194701

before gc: list nodes free: 290431

after gc: idd nodes used:2808, unused:63997192; list nodes free:285193871

before gc: list nodes free: 138427

after gc: idd nodes used:2739, unused:63997261; list nodes free:285194138

before gc: list nodes free: 210879

after gc: idd nodes used:2747, unused:63997253; list nodes free:285193970

before gc: list nodes free: 890509

after gc: idd nodes used:2650, unused:63997350; list nodes free:285194700

before gc: list nodes free: 35040

after gc: idd nodes used:2694, unused:63997306; list nodes free:285194325

before gc: list nodes free: 2049611

after gc: idd nodes used:2824, unused:63997176; list nodes free:287290559

before gc: list nodes free: 1926391

after gc: idd nodes used:2876, unused:63997124; list nodes free:287290492

before gc: list nodes free: 1785761

after gc: idd nodes used:2892, unused:63997108; list nodes free:287290565

before gc: list nodes free: 1648299

after gc: idd nodes used:3029, unused:63996971; list nodes free:287289365

before gc: list nodes free: 1507213

after gc: idd nodes used:3045, unused:63996955; list nodes free:287289305

before gc: list nodes free: 1375922

after gc: idd nodes used:2936, unused:63997064; list nodes free:287290113

before gc: list nodes free: 1256819

after gc: idd nodes used:3103, unused:63996897; list nodes free:287288882

before gc: list nodes free: 464632

after gc: idd nodes used:3175, unused:63996825; list nodes free:287288670

before gc: list nodes free: 1710726

after gc: idd nodes used:3443, unused:63996557; list nodes free:289384247

before gc: list nodes free: 10218

after gc: idd nodes used:4633, unused:63995367; list nodes free:289378205

before gc: list nodes free: 2032522

after gc: idd nodes used:4665, unused:63995335; list nodes free:291474725

before gc: list nodes free: 1972017

after gc: idd nodes used:4219, unused:63995781; list nodes free:291477322

before gc: list nodes free: 1624230

after gc: idd nodes used:4453, unused:63995547; list nodes free:291475689

before gc: list nodes free: 1563300

after gc: idd nodes used:6535, unused:63993465; list nodes free:295660335

before gc: list nodes free: 2095391

after gc: idd nodes used:9133, unused:63990867; list nodes free:295648259

before gc: list nodes free: 1086145

after gc: idd nodes used:9220, unused:63990780; list nodes free:295647484

before gc: list nodes free: 2191366

after gc: idd nodes used:9625, unused:63990375; list nodes free:295645678

before gc: list nodes free: 2244790

after gc: idd nodes used:8966, unused:63991034; list nodes free:295649875

before gc: list nodes free: 2651942

after gc: idd nodes used:8021, unused:63991979; list nodes free:295653250

before gc: list nodes free: 3085764

after gc: idd nodes used:7864, unused:63992136; list nodes free:295654041

before gc: list nodes free: 2803958

after gc: idd nodes used:8189, unused:63991811; list nodes free:295651650

before gc: list nodes free: 2066854

after gc: idd nodes used:8212, unused:63991788; list nodes free:295652286

before gc: list nodes free: 2265294

after gc: idd nodes used:8437, unused:63991563; list nodes free:295650372

before gc: list nodes free: 1863892

after gc: idd nodes used:8394, unused:63991606; list nodes free:295651586
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6099160 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16102392 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.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 CTLFireability -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.002sec

2225 2250 2141 2374 2201 2293 2436 2339 2326 2311 2238 2374 2477 2384 2416 2413 2513 2516 2453 2446 2439 2519 2572 2485 2472 2475 2518 2657 2445 2510 2531 2511 2669 2603 2527 2456 2588 2707 2629 2520 2487 2613 2673 2679 2660 2591 2632 2713 2699 2671 2608 2559 2735 2840 2661 2628 2704 2803 2789 2739 2741 2687 2847 2908 2762 2644 2692 2918 2934 2890 2814 2829 2866 3024 2908 2802 2824 2902 2993 2950 2816 2891 2915 3072 3032 2953 2874 2970 3034 2959 2898 2959 3073 3125 3003 2932 2882 2947 2468 3111 3085 2937 3130 3400 3471 3212 3130 3098 3310 3472 3447 3534 3446 3376 3311 3456 3341 3406 3948 4664 4545 4875 4654 4645 4879 4591 4571 4655 4348 4467 4270 4431 4298 4374 4267 4429 4416 4205 4351 4320 4364 7026 6511 6552 6445 9007 9196 8912 9228 9483 9426 9203 8975 9039 8881 9187 9262 9328 8980 9289 9021 9208 9236 9385 8012 7770 8029 8010 7996 7669 7692 7896 7782 8467 7951 7856 7755 8011 7818 8124 7817 7871 7924 8022 7934 7826 7717 8035 7867 8362 7967 7953 7906 8021

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-050A"
export BK_EXAMINATION="CTLFireability"
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-050A, examination is CTLFireability"
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-167903717800322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050A.tgz
mv ShieldIIPt-PT-050A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;